Method and apparatus for distributing large payload file to a plurality of storage devices in a network

ABSTRACT

Large payload files are selectively partitioned in blocks and the blocks distributed to a plurality of distribution stations at the edge of the network qualified to have the data. Each qualified station decides how much and what portion of the content to save locally, based on information such as network location and environment, usage, popularity, and other distribution criteria defined by the content provider. Different pieces of a large payload file may be available from different nodes, however, when a user requests access to the large payload file, for example, through an application server, a virtual file control system creates an illusion that the entire file is present at the connected node. However, since only selective portions of the large payload file may actually be resident at that node&#39;s storage at the time of request, a cluster of distribution servers at the distribution station may download the non-resident portions of the file as the application server is servicing the user. The download may be in parallel and usually from the least congested nodes. New nodes added to the network learn from other nodes in the network what content they should have and download the required content, in a desired amount, onto their local storage devices from the nearest and least congested nodes without interrupting network operation. Each node manages its local storage and decides what content to prune based on information such as usage patterns.

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] This application is a divisional of U.S. application Ser. No.09/681,644, filed on May 15, 2001, entitled “Method and Apparatus ForLarge Payload Distribution in a Network,” which claims the benefit ofU.S. Provisional Application No. 60/266,286, filed on Oct. 26, 2000,entitled “Large Payload Delivery Networks Having Integrated ContentManagement Services,” the specification of which is herein incorporatedby reference.

BACKGROUND OF INVENTION

[0002] This invention relates to the field of content delivery. Morespecifically the invention relates to delivering large payloads (i.e.,files) closer to users in a network environment.

[0003] Content delivery in a network environment involves sendinginformation (e.g., in the form of a file) from a content provider tomultiple content servers which may serve their content to multiple usersresiding at various destinations on the network. The content providergenerally puts the information that is to be distributed onto a computerconnected to a network. This computer is often referred to as a contentserver. Any client-server or peer-to-peer communication protocols may beapplied for a content server to further transfer the information to agroup of content servers in the same or different networks that areassigned to serve the information. The source content server is usuallycalled the origin server. The information resides in a file on a contentserver and is available to users of the network. When users requestaccess to the information, the contents of the file are delivered fromany of the content servers that are assigned to serve the content to therequesting users using the desired file transfer protocol (i.e., methodof transfer). A content server may receive the information from anorigin server before any user request, or it may retrieve theinformation from an origin server upon user request. A content servermay be assigned to serve information from multiple origin servers, andan origin server may forward only part of its information to a set ofcontent servers. The owner of the content servers is usually calledcontent delivery network (CDN) provider. In a network such as theInternet, for example, a user may access the network via an InternetService Provider (ISP) connecting through a central office (CO) of atelephone company or a head end (HE) of a cable company. Thus, the ISPacts as the user's gateway to the Internet. Examples of ISPs includeAmerica On Line™ (AOL™) and Earthlink™ Some telephone companies andcable companies are also ISPs. ISPs may interconnect to each other'snetwork, they may connect to a backbone provider, telephone company'snetwork, cable company's network, or any private or public network.Backbone providers provide high bandwidth connectivity for ISPs,enterprise, etc. Through the ISP, CO, or HE, the user may accessservices (e.g., data) available from content providers from any contentservers in the network.

[0004] Various types of data (i.e., information) may be transmitted overa network. For example, when a user desires access to web pages, textdocuments, application programs, static images, audio, video, or anyother type of data available from a remote content server, the contentsof the files containing the desired data (i.e., information) must thenbe delivered to the user from the content server. Files containing webpages and text documents are generally small compared to some other filetypes, such as files containing video or multimedia data. Therefore,transferring a web page from a content server in a remote location, suchas Australia, to a user in United States may take less than a fewseconds. However, transferring a video file, for example, may takeminutes to hours depending on the size of the video file and the speedof the users connection. Such transfers place a huge demand on thenetwork that may result in lost data. For example, when data is sentacross the Internet the receiving system may not receive all of the datatransmitted from the content server. This is because the data packets(data is generally transferred in packets) may pass through some routerswhere some packets may be dropped due to congestion. The receivingsystem notifies the server of the missing data so that it may resend thedata. In some cases, dropped packets can slow or halt the delivery ofcontent because if many servers keep resending data to their clients,the routers get even more congested and thus more dropped packets.

[0005] Network-based content delivery that relies on a single source tosimultaneously distribute various types of information to multipleremote locations may, depending on the size of files being transferred,encounter network-loading problems around the server or the serveritself may be over tasked. For example, since transferring a small file(e.g., a web-page) usually takes only a few seconds, the massivedistribution of a small file from one source to thousands of destinationlocations may not create large impact on the network traffic near thesource. Transferring a large file (i.e., a large payload), in contrast,can take tens of minutes to hours. If the distribution of such payloadsrelies on a single source, the network performance near the source, andthe subsequent delivery of content, could degrade severely and becomeunacceptable.

[0006] Therefore, while it may be acceptable to rely on a single sourceto distribute small files (e.g., web pages, text, or small images), thepotential for server and/or network overload calls for using multiplesources to distribute large files to multiple clients.

[0007] The fast-paced expansion of the broadband industry has fueled thepush for rich media (e.g., full length movies, video, or other types ofmultimedia data). Broadband technology brings high-speed connectioncapabilities for content delivery to remote users hence large payloadscan be transferred faster. Also, broadband technology makes it possibleto send audio and/or video data using streaming media whereby the datais sent in streams for real-time playback, for example. Thus, thequality of rich media at the user's terminal, more than that of anyother type of information, is now more dependent on the performancecapabilities of the delivery technology. In order to minimize deliverydelays, network congestion, and other related problems, some systemsattempt to locate content on server systems that are located in closeproximity to, i.e., a few hubs of connections away from the end-users.These server locations approximately define the concept known as the“edge” of the network. For example, the Internet service providers arein close proximity to the end-user thus may be regarded as being at theedge of the network. When servers are placed in such locations, theservers are said to be at the edge of the network. End-user systems thatare configured to obtain content from network nodes located at the edgeof the network are therefore beyond the edge of the network (a.k.a. lastmile). However, it is important to note that systems located beyond theedge of the network are still coupled to the network and capable ofcommunicating with the server computers located at the edge. Placingcontent at the edge of the network is advantageous because it can reducethe latency in servicing users located beyond the edge. Currentapproaches for delivering large payloads to the “edge” consist ofmirroring or caching. These approaches and the limitations inherent ineach approach will now be discussed in detail so as to give the readeran understanding of the advancements made by the invention.

[0008] Caching

[0009] A simple example of caching is web caching. In its simplest form,web caching involves a cache appliance located between a client user andan origin server such that data fetched once from the origin server issaved in the cache device (appliance) to service subsequent requests forthe same data. An illustration of caching is shown in FIG. 1, forexample. A client user at browser 104 in Local Area Network (LAN) 108desiring to obtain data available from origin server 100 enters theUniversal Resource Locator (URL) address of the desired data intobrowser 104. LAN 108 may be an ISP's network, for example. The requestis forwarded to cache appliance 102, which is an HTTP (Hyper TextTransport Protocol) proxy server in this illustration. The proxy serverwhich may, for example, be owned by the ISP is typically located at theISP's local network. Like any other server, proxy servers (cacheappliance) 102 and 103 are computers with local processing and memory. Asubset of that memory is known as the proxy cache. Cache is generallyused as temporary storage for frequently used information. Note that,although only one cache appliance is shown in each ISP's local areanetwork of FIG. 1, an actual implementation may have more than one cacheappliance in an ISP's local area network.

[0010] Proxy server (i.e., cache appliance) 102 processes the requestreceived from client at browser 104 and searches its cache (i.e.,memory) for the requested data, if the data is not available in itscache, proxy server 102 forwards the request to origin server 100 vianetwork router 101. In this illustration, network router 101's solepurpose is to forward requests to origin server 100. Origin server 100is an HTTP server with single TCP/IP (Transmission ControlProtocol/Internet Protocol) connection path 110 to client user atbrowser 104.

[0011] Origin server 100 services the request and forwards the requesteddata to cache appliance 102. Upon receipt of the data, cache appliance102 may save the data in its local cache memory and also forwards it tobrowser 104. The data is said to be cached in HTTP proxy (cacheappliance) 102. A subsequent client user at browser 105 desiring thesame data gets their request serviced by HTTP proxy server (cacheappliance) 102 without the request being forwarded to HTTP server 100.However, users 106 and 107 at LAN 109 requesting the same data wouldhave their initial request serviced by HTTP server 100 because users 106and 107 are not connected through HTTP proxy 102 which has the datacached in memory. Instead, HTTP proxy 103 would perform the sameprocesses as discussed above for HTTP proxy 102 to obtain and cache thedata in its memory. Thus, proxy servers 102 and 103, which are said tobe at the edge of the network, are populated upon user demand.

[0012] Once the data is cached in HTTP proxy 102 and 103, origin server100 would not need to service requests for the same data from usersconnecting through HTTP proxy servers 102 and 103. By caching the dataat various proxy servers closer to the users, delivery of content isdistributed thereby reducing the load around the network server.

[0013] However, caching is only good for delivering static content datathat is fixed in memory such as static web pages. Caching does not workfor dynamic information such as services (e.g., functions, transactions,etc.), streaming media, or any other type of dynamic information.

[0014] The HTTP protocol is well known to those of ordinary skill in thearts; therefore software to perform the caching function at HTTP proxyservers 102 and 103 is readily available. However, this is not the casewith streaming media because different providers of streaming serversuse differing protocols to transmit data to the recipient player (e.g.,a browser). FIG. 2 is an illustration of a typical streaming serverconnection to a player.

[0015] In contrast to HTTP TCP/IP connections to the browser, Streamingserver 200 is connected to player 201 via three connection paths. Path202 is the Real-Time Streaming Protocol (RTSP) connection. RTSP is aprotocol that provides for control over delivery of data with real-timeproperties such as audio and video streams. RTSP contains a descriptionof media data and provides playback controls such as play, rewind,fast-forward, and pause to player 201. Playback may be done with anoffset so that a player can start receiving the data from a specifiedpoint. For example, when player 201 rewinds, a different offset,corresponding to the desired playback position, is sent to streamingserver 200 and incoming data is sent through path 203 starting from thenew offset. Path 203 utilizes the Real-Time Transport Protocol (RTP) andmay contain the data being played back. The third connection, path 204,utilizes the RTP Control Protocol (RTCP) and it may provide flow controlof the data.

[0016] Caching does not work well for streaming media because thevarious providers of streaming servers use differing intelligence tocompute the data being sent over connection 203 as a function of theoffset and the flow control. Moreover, server providers do not follow acommon standard, therefore placing a cache appliance between streamingserver 200 and player 201 would not be readily feasible unless theintelligence, which in today's implementation is in the streamingserver, is included either in the streams of information being sent overthe connection paths, or if the cache appliance contains theintelligence used by every streaming server provider. Thus, existingsystems do not currently provide a viable way to cache streaming mediadata. Also, since caching is usage based, when content is not cached theproxy will need to fetch the content hence there is a potential formisses and there is no guarantee of quality.

[0017] Despite these limitations, caching has advantages such as ease ofgrowth because a new cache appliance can be added anywhere and it willbe up and running; a cache appliance can be shared by different contentproviders; and a cache appliance is very lightweight (i.e., does notrequire special configuration) and thus easier to manage.

[0018] Mirroring

[0019] Mirroring is a scheme for providing content-delivery to users atthe “edge” of the network that addresses many of the limitations ofcentralized systems by replicating content to the edge of the network,thereby minimizing the distance between where content is requested andwhere it is served. In so doing, mirroring saves network bandwidth ascompared to delivery to multiple users from one centralized source. Thefundamental principles underlying mirroring includes central control ofcontent and the network, efficient distribution of content to theservers at the edge of the network, and automatic redirection of contentrequests from a user to a local edge server.

[0020] In mirroring, file servers are placed throughout the network(e.g., Internet), close to where the content requests originate. Thisprinciple mirrors some of the functionality of caches, but with distinctdifferences. In particular, these file servers work together in acentrally controlled collaborative fashion to ensure overall networkperformance. Like a cache, content is replicated from the origin serverto the server only once, regardless of the number of times the contentis served. However, mirroring provides greater content control. Bypre-populating the server, the content will be available for fastdelivery to the user, eliminating cache misses and increasing the hitrate. Mirroring, in combination with caching, delivers abetter-integrated solution with the benefits of both approaches.

[0021] One URL applies to all the servers in a mirroring implementation.When a browser requests the URL, the system determines a local deliveryserver based on:

[0022] geographical and network location; presence of content; andcurrent status of server (both availability and load).

[0023]FIG. 3 is an illustration of a network content delivery schemeemploying mirroring to push content to the edge of the network. Assumingboundary 300 represents the edge of the network, mirroring locates fileservers (e.g., FS 301-308) at the edge, as shown in FIG. 3. In thisillustration, File Server 301 is the master server controlling all otherfile servers (e.g., 302-308). All content that needs to be pushed to theedge are loaded into master server 301, and then replicated into all theother file servers 302-308 using a preferred push method. For example,the content could be replicated using the multicast method discussedbelow.

[0024] Unlike caching, where the content must be static (i.e., does notchange with time), mirroring works well for non-static data such astransactions because transaction data can be synchronized from themaster server (e.g., FS 301) to the file servers at the edge of thenetwork (e.g., FS 302-308). The various methods of replicating data tofile servers at the edge may include broadcast, a transmission from themaster server to all listening file servers in the network; anycast, atransmission to the nearest group of servers; unicast, a transmission toa specific receiver; and multicast, a transmission to multiple specificreceivers (a more detailed discussion of multicasting is discussedbelow). Once content is delivered at the edge, a user at browser 330requesting access to content is automatically routed to thegeographically closest server (e.g., server 307) that is able to servicethat request.

[0025] Mirroring also works well for streaming media. Streaming serverscan be attached to any of file servers 301-308 to provide serviceclosest to where it is needed. For example, by attaching a streamingserver 310 to file server 302 a user at player 320, in the geographicvicinity of file server 302, can playback streaming media data withoutmuch latency. Thus, in mirroring implementations, streaming servers canbe attached to any of the file servers to overcome the limitations ofcaching. However, current methods suffer significant disadvantages, forexample, a large object such as video that is popular may create ahotspot on a disk because of repeated access to the content and becausedisk input/output bandwidth is limited. Moreover, the large object needsto be fully transferred to either the application server or the cacheappliance before satisfaction of an end-user client request for the datamay commence thereby creating potential latency issues.

[0026] Mirroring, also, can be very expensive due to scalability issues,storage limitations, management costs, and inadequate load balancing.Scalability issues arise from the need to store entire large files, suchas video, within a storage media. Therefore, new storage must be addedto all the file servers in the network when available storage isinadequate for storing a particular large file. Since all the fileservers in the network must maintain the same file configuration,upgrading all the file servers in the mirroring environment could proveto be very expensive. Additionally, new file servers brought into thenetwork would need to be configured to conform to all other file serversin the network.

[0027] Adding more storage requires rack space for mounting the newstorage devices.

[0028] Rack space is usually limited and sometimes expensive. Moreover,as storage capacity increases, more system administration functions(e.g., backup) are needed to manage the configuration. Since cost ofsystem administration is expensive and rack space is limited, mirroringsuffers.

[0029] Content Distribution Using Multicast

[0030] Multicast is simultaneous communication between a single senderand multiple selected receivers on a network. FIG. 4 is an illustrationof a distribution network that uses multicast technology to pushinformation to multiple content servers on a network.

[0031] The source provider uploads the large payload (e.g., video file,image data, or any other file having a size significant enough to strainnetwork resources) onto the root server 400 which may be, for example, acontent server located in Los Angeles. The root server may also bereferred to as the origin server. Root server 400 subsequentlymulticasts the video data to multiple servers. (e.g., servers 401through 403) that are at the second level of the network server tree,usually in differing geographical locations. For example, server 401 maybe located in San Diego, server 402 in San Jose, and server 403 in SanFrancisco. After receiving the video data, servers 401 through 403 willmulticast the video data to servers in the next level of the servertree. For example, server 401 multicasts the data to servers 404 through406, server 402 multicasts the data to servers 407 through 409, andserver 403 multicasts the data to servers 410 through 412. In thisillustration, each server multicasts to three other servers, however,most implementations involve multicast to more than three servers (e.g.,ten servers).

[0032] After the video data is distributed amongst servers 400 through412, the video data becomes available from multiple servers that arelocated in different geographical localities on the network. Thisdistribution method pushes content to the edge into a mirroring typearchitecture where user requests may be serviced from one of multipleservers, usually from the geographically closest server. Multicastingthe entire large payload file may still cause congestion due toinsufficient capacity on a particular communication link; networkequipment congestion due to processing speed of networking equipment;server congestion due to data processing speed of the server; andlatency in the network due to the time associated with the datatraveling over long distances.

[0033] Load Balancing

[0034] Load balancing is the task of distributing the network load andthe processing load to a cluster of servers to improve systemperformance, while simultaneously increasing the reliability of theservice provided by the servers. A load balancer is often implemented aseither a switch or a router and called a load balancing switch or a loadbalancing router respectively. A load balancer's network interface, theVirtual IP address (VIP), serves as a virtual external interface for theserver cluster. Each server in a cluster has both an internal (local IPaddress) and an external (IP address) network interface. Most loadbalancers provide a feature called Network Address Translation (NAT),which translates VIP to a local IP address, which are useable on theInternet. A load balancer accepts all data packets addressed to its VIP,and distributes them equally to the most available servers.

[0035] A load balancer maintains a state table (e.g., what server isservicing what client), so that data packets of a persistent sessionflow to and from the same client and server end points. Many loadbalancers have a configurable “sticky” feature that distributes datapackets from a client to the same server that the client was previouslyconnected to. The “sticky” feature allows a server to intelligentlyprepare for possible future requests from its clients.

[0036] Load balancers can typically operate in either a “regular” (i.e.,non-transparent) mode or a “transparent” mode. The difference between“regular” mode and “transparent” mode lies in the management of inboundand outbound data flow. In “regular” mode, all inbound traffic to andoutbound traffic from the server cluster passes through the loadbalancer. In “transparent” mode, outbound traffic from the servercluster bypasses the load balancer by flowing directly through an IProuter. The “transparent” mode can be extremely important for a networkof servers delivering large amounts of data, as it reduces the overallload on the load balancing router and thus improves network performance.When a load balancer is operating in “transparent” mode, it does nottranslate the destination IP in the inbound packets from clients to itsserver cluster. An IP router must be connected both to the load balancerand the server cluster to do this. The servers in the server cluster arethen configured with a loop back interface using the IP address of theload balancer and with a default route to the IP router.

[0037] Most load balancers provide either a remote or local ApplicationProgramming Interface (API) or scripts to manage their load balancingtasks. In general, current technology uses a round-robin approach (i.e.,the next server in the queue services the next client) to load balance acluster of available servers. This may mean that servers are allocatedtasks even if they don't have available bandwidth.

[0038] Therefore, there is a need to address the cost, scalability, andload-balancing issues associated with large payload delivery to the edgeof the network. However, before discussing the present invention, ageneral overview of how files are handled in different operating systemsis presented.

[0039] File Configuration on Computer Systems

[0040] The overall structure in which files are named, stored, organizedand accessed in an operating system is referred to as a “file system”.In the UNIX operating system, for example, each directory can be mountedwith a file system. If a directory /X is mounted with file system Y, anystorage I/O (Input/Output) request within the sub-tree /X is forwardedto the file system Y. For example, opening of a file /X/foo.txt causesthe open request to be forwarded to the corresponding “open” routine infile system Y.

[0041] Contemporary operating systems, such as Unix and Windows, support“stackable file systems”. A stackable file system is a file system thatis built on top of another file system. For example, if a stackable filesystem F is built above file system K, and if directory /X is mountedwith F, then opening of a file /X/foo.txt causes the open request to goto file system F. File system F processes the request and it may or maynot generate a request to file system K. In the Windows operating systemenvironment, a stackable file system is called a file filter. A filefilter can be placed on any directory. Any I/O access to a directorythat has a file filter causes a corresponding file filter routine to beexecuted. A file filter may or may not send any request to theunderlying file system.

[0042] A distributed file system is one in which files may be located onmultiple servers connected over a local or wide area network. Adistributed file system can be implemented using any one of severalwell-known network file system protocols, e.g., the Common Internet FileSystem (CIFS) and Sun Microsystems, Inc.'s Network File System (NFS)protocol. CIFS is based on the standard Server Message Block (SMB)protocol widely in use by personal computers and workstations running awide variety of operating systems. The CIFS protocol supports a numberof file sharing and representation features, such as: file access, fileand record locking, safe caching, read-ahead, and write-behind, filechange notification, protocol version negotiation, extended attributes,distributed replicated virtual volumes, and server name resolution. NFS,like CIFS, is intended to provide an open cross-platform mechanism forclient systems to request file services from server systems over anetwork. The NFS protocol provides transparent remote access to sharedfiles across networks because it is designed to be portable acrossdifferent machines, operating systems, network architectures, andtransport protocols. NFS' portability is achieved through the use ofRemote Procedure Call primitives (RPC primitives) that are built on topof system implementations that use the External Data Representationstandard (XDR). The RPC primitives provide an interface to remoteservices. A server supplies programs (e.g., NFS), each program includinga set of procedures. The combination of a server's network address, aprogram number, and a procedure number specifies a specific remoteprocedure to be executed. XDR uses a language to describe data formats.The language can only be used to describe data; it is not a programminglanguage. NFS Implementations exist for a wide variety of systems. NFSmount protocol allows the server to hand out remote access privileges toa restricted set of clients and to perform various operatingsystem-specific functions that allow, for example, attaching a remotedirectory tree to a local file systems.

[0043] The above examples illustrate the limitations and problemsassociated with current systems for distributing large files. Because ofthese problems there is a need for a method and apparatus that utilizesa more effective means for delivering large payloads.

SUMMARY OF THE INVENTION

[0044] An embodiment of the invention provides an improved mechanism fordistributing large files throughout a computer network and deliveringsuch files to an end-user system. When the invention is implemented itprovides multiple users with a way to obtain access to large payloadfiles without overburdening network resources. If, for example, a userwishes to download a large file such as a video file an embodiment ofthe invention provides a way to deliver that video file to therequesting user without putting a strain on the network. The systemaccomplishes this by breaking the large file into multiple portions andstoring those portions in locations (e.g., nodes) distributed throughoutthe network. The portions stored throughout the network are distributedutilizing a flow optimization technique that provides for theintelligent management of large data files. Thus, the portions of largedata file are stored in locations that minimize the amount of time ittakes to deliver the portion to the end-user system. These locations arereferred to by those of ordinary skill in the art as the edge of thenetwork.

[0045] Each node at the edge of the network embodying aspects of theinvention is configured to appear as if it has the large file storedlocally when portions of the file are really stored on other nodeslocated throughout the network. This greatly increases the virtualstorage capacity of each network node without consuming systemresources. When the end-user system issues a request for content (e.g.,a large data file) the request is routed to the nearest node and thesystem delivers the requested content to the node in manner thatmaximizes data transfer efficiency while minimizing bandwidthconsumption. The end result is that each network node has access tonumerous large data files without having to store each of those datafiles locally.

[0046] In one embodiment of the invention, the system is optimized sothat large payload files can be distributed across existing networks(including the Internet and corporate intranets) using a transport layernetwork overlay to push content to the edge of the network.Specifically, the embodiments of the invention improve large payloaddelivery performance, scalability, reliability, and availability.

[0047] As mentioned above, one embodiment of the invention breaks thelarge payload files into multiple portions. This may be accomplished byselectively partitioning the large payload file into blocks that arereplicated and distributed to a plurality of distribution stations(a.k.a. nodes) at the edge of the network. Each distribution station isconfigured to determine how much of the content to save locally, basedon information such as usage, popularity, etc. The content providerdefines what distribution stations are qualified to function asdistribution stations and may also define other distribution criteria.Distribution stations in the network manage storage and transfer content(e.g., portions of large payload files) and other information to oneanother. Different pieces of a large payload file may be available fromdifferent nodes, however, when a user requests access to the largepayload file, for example, through an application server (e.g., astreaming server), a virtual file control system creates an illusionthat the entire file is present at the connected node. However, sinceonly selective portions of the large payload file may actually beresident at that node's storage at the time of request, the distributionstations may download the non-resident portions of the file as theapplication server is servicing the user. The download of thenon-resident blocks may be in parallel and usually from the leastcongested nodes. The entire process is transparent to the user.

[0048] The required portions of the requested file are received andreassembled in real-time using one or more associated file serverscalled the virtual file control system server. The virtual file controlsystem provides the reassembled file to the application server servicingthe client. The virtual file control system can be implemented either asa stackable file system, as a proxy file server using an underlyingnetwork file system such as NFS or CIFS, a storage-area network (SAN),or direct attached storage, or as a combination of these methods.Whichever implementation is used, the virtual file control systemobtains the content from the underlying file systems.

[0049] Scalable content delivery network stations are geographicallydispersed to the edge of the network in order to optimally serviceend-user client systems that are located beyond the edge. End-userclient requests for data are automatically serviced at the nearest leastcongested station. In one or more embodiments of the invention, thescalable content delivery network is integrated into existing servicesat the Internet's edge to take advantage of these services (e.g., theApplication Servers in some embodiments of the current invention mightbe Streaming Servers in operation within a service provider's existingbase of systems).

[0050] In one or more embodiments, new nodes may be added to the networkwithout service interruption. As the new nodes are added, they learnfrom other nodes in the network what content they should have anddownload the required content, in a desired amount, onto their localstorage from the nearest and least congested nodes.

[0051] Thus, a node could be added to the network and it would be up andrunning after self-initialization.

[0052] In one or more embodiments, the portions and amount of a largepayload file maintained at each node depends on the available storage,popularity of the content, distribution criteria by the contentprovider, etc. Thus, least likely to be used blocks of a large payloadfile may be pruned (i.e., deleted from local storage) to make room forother highly desirable content. However, although the least likely to beused blocks of a file are pruned, the entire content of a large payloadfile may be maintained at a node in the scalable content deliverynetwork, so long as the content provider wants the content to remain inthe network.

BRIEF DESCRIPTION OF THE DRAWINGS

[0053]FIG. 1 is an illustration of caching methods of content delivery.

[0054]FIG. 2 is an illustration of a typical streaming server connectionto a player.

[0055]FIG. 3 is an illustration of a network content delivery schemeemploying mirroring to push content to the edge of the network.

[0056]FIG. 4 is an illustration of a distribution network that usesmulticast technology to push information to multiple servers on anetwork.

[0057]FIG. 5 is an illustration of a scalable content delivery networkfor delivering large payloads according to an embodiment of the presentinvention.

[0058]FIG. 6 is an illustration of a virtual tree arrangement of thenodes for control information communication in accordance with anembodiment of the present invention.

[0059]FIG. 7 is a simplified layout of a distribution center inaccordance with an embodiment of the present invention.

[0060]FIG. 8 is an illustration of linear and non-linear file structuresas used in the present invention.

[0061]FIG. 9 shows the process of decomposing a large payload file intoblock files for storage in accordance with an embodiment of the presentinvention.

[0062]FIG. 10 is an illustration of a decomposed large payload file inaccordance with an embodiment of the present invention.

[0063]FIG. 11 is a diagram showing the process of reconstructing a largepayload file from multiple block files.

[0064]FIG. 12 is an illustration of the attribute bitmap and rolled upbitmap, in accordance with an embodiment of the present invention.

[0065]FIG. 13 is an illustrative embodiment of the distribution of alarge payload file within the network of the present invention.

[0066]FIG. 14 is an illustrative example of another embodiment of theScalable Content Delivery Network.

[0067]FIG. 15 is an illustration of a scalable content delivery networkstation in accordance with an embodiment of the present invention.

[0068]FIG. 16 provides an alternate illustration of the Scalable ContentDelivery Network of FIG. 14.

[0069]FIG. 17 is an illustration of a distribution server clusterconfiguration in accordance with an embodiment of the present invention.

[0070] FIGS. 18A-18C provide three illustrative embodiments of theapplication server cluster in accordance with embodiments of the presentinvention.

[0071]FIG. 19 is used to illustrate the actions of a Virtual FileControl System Server in accordance with an embodiment of the presentinvention.

[0072]FIG. 20 is an illustration of the control unit and data of astation in the scalable content delivery network in accordance with anembodiment of the present invention.

[0073]FIGS. 21A through 21G are illustrative examples of Stationoperation and data flow in accordance with embodiments of the presentinvention.

[0074]FIG. 22 is a flow diagram of the operations of a VFCS Serverperformed during the VFCS initialization process in accordance with anembodiment of the present invention.

[0075]FIG. 23 shows the VFCS Server operations performed during runtime.

[0076]FIG. 24 is an illustration of the contents of the contentmanagement and usage database of FIG. 20.

[0077]FIG. 25 illustrates how new nodes adaptively initialize bylearning and downloading content they should have, within the scalablecontent delivery network.

DETAILED DESCRIPTION OF THE INVENTION

[0078] An embodiment of the invention provides an improved mechanism fordistributing large files (referred to as large payloads) throughout acomputer network and delivering such files to an end-user system. In thefollowing description, numerous specific details are set forth toprovide a more thorough description of embodiments of the invention. Itwill be apparent, however, to one skilled in the art, that the inventionmay be practiced without these specific details. In other instances,well known features have not been described in detail so as not toobscure the invention.

[0079] When the invention is implemented in accordance with oneembodiment of the invention it provides end-user systems with a way toaccess large payload files without overburdening the network utilized bythe end-user system to transmit data. In one embodiment of theinvention, the system accomplishes this by breaking the large payloadfile into multiple portions and storing those portions in locations(e.g., nodes) distributed throughout the network. The portions storedthroughout the network are distributed utilizing a flow optimizationtechnique that provides for the intelligent management of the largepayload files. Thus, portions of the large payload file are stored inlocations that minimize the amount of time it takes to deliver theportion to the end-user system. These locations minimize the latencyassociated with delivering the file to the end-user system and arereferred to herein as the edge of the network.

[0080] Each node at the edge of the network embodying aspects of theinvention is configured to appear as if it has the large payload storedlocally when portions of the file are really stored in on other nodeslocated throughout the network. This greatly increases the virtualstorage capacity of each network node without consuming systemresources. When the end-user system issues a request for content (e.g.,a large payload) the request is routed to the nearest node and thesystem delivers the requested content to the node in manner thatmaximizes data transfer efficiency while minimizing bandwidthconsumption. The end result is that each network node has access tonumerous large data files without having to store each of those datafiles locally. Thus, one or more embodiments of the present inventionprovide efficient methods and apparatuses for delivering a large payloadto the edge of a network without the cost, scalability, load balancing,and other issues associated with prior art methods of content delivery.

[0081]FIG. 5 provides a view of a scalable content delivery network(SCDN) for delivering large payloads according to an embodiment of thepresent invention. SCDN 500 may be a network such as the Internet whichconceptually includes a network core 505 (i.e., the backbone),intermediate network segments 510 ranging “near” and “far” from thecore, and network segments “far” from core 520-A through 520-C(collectively 520). “Near” and “far” relate to distance and are intendedto indicate relative path latencies (short or long, respectively) to thecore, such latencies generally depend on the number of intermediate hubs(e.g., switches, routers, and the like) that are traversed to reach thehigh-speed backbones that form the core of the network and through whichmuch of the network traffic is routed. Note that each intermediate hubmay perform some limited processing, which adds latency, beforeforwarding the traffic to the next hub.

[0082]FIG. 5 shows a plurality of Content Provider Client (CPC) systems530, a plurality of End-User Client (EUC) systems 550, and one or moreContent Management Servers (CMS) 570, all located beyond Network Edge501. In general, the content provider client 530 may be connected (orassigned) to a content management server 570, which in turn is connectedto its assigned distribution center 540. A content provider uploadsand/or manages large payload files in the SCDN 500 through its CPC 530.

[0083] The EUC 550 provides the end-user access to files in SCDN 500.For example, EUC 550 may be a browser running on the end-user's localcomputer.

[0084] Network Edge 501 generally may be far from network core 505.However, the distance (i.e., path latency) between the core and the edgemay not be uniform and may vary considerably for a given CPC or EUC. Oneembodiment of the present invention places a plurality of DistributionCenters (DC) 540A-5401 for maintaining large payloads at the edge of thenetwork thereby resolving the latency issue. Large payload content froma content provider is pushed from one distribution center to otherdistribution centers at the edge of the network. An end-user seekingaccess to a large payload is serviced (via an application server) fromthe nearest distribution center containing the desired content. Bydistributing content to the end-user (e.g., at EUC 550) via a pluralityof Application Servers 560 and distribution centers 540 at the edge,path latency is minimized. Thus, large payload distribution involvesobtaining a large payload file from a content provider andgeographically placing such file at the distribution centers which areat or as close to the edge of the network as possible.

[0085] The distribution centers 540A-540I in SCDN 500 of FIG. 5 arevirtually arranged in the form of a tree as illustrated in FIG. 6, forexample. This virtual tree arrangement is primarily used forcommunication of control information amongst the nodes of the scalablecontent delivery network. Data downloads can be performed from any nodein the network having the desired data, preferably the nearest node(distance-wise). Nodes A through /of FIG. 6 represent DC 540A through5401, respectively. The nodes are arranged in a logical order. Forexample, assuming node B represents Europe-England, then logical childnodes in Europe might be Europe-France (e.g., node D) and Europe-Germany(e.g., node E), and a child node of Europe-France might be Europe-Italy(e.g., node H). In this example where the left side of the treerepresents Europe, the right side may represent Asia. Node A is the rootnode and may represent a central control station, for example. In one ormore embodiments, each node in the tree has a unique attribute setrepresenting the name of the node. The attribute set for a node isstored in the node and can be represented in any convenient datastructure. For example, the attribute set can be represented as avariable bitmap (a bitmap is the binary representation of an object,e.g., a number). Each node also contains a representation of theattribute set of each of the node's children, grand children, greatgrandchildren, etc. (i.e., all nodes emanating from that node as a rootnode lineal descendants). This representation is called the “Rolled UpSet of Attributes” and any convenient data structure can be used for it.Thus the rolled up attribute of a node is the representation of therolled up attribute of its children. For example, a “Rolled Up Bitmap”,which is a combination of the rolled up attribute bitmaps of all thenode's children, may be used. A “Rolled Up Bitmap” may be defined as the“binary OR”(a.k.a. Bitwise OR) of the rolled up attributes of the node'schildren. FIG. 12 is an illustration of the attribute bitmap and rolledup bitmap, in accordance with an embodiment of the present invention.Bitmaps 1200, 1210,1220,1230,1240, and 1250 use 16 bits for illustrationpurposes but since the bitmaps are variable, they may vary as needed toidentify each node and provide other necessary information.

[0086] Bitmap 1200 representing the attribute set for node B of FIG. 6has, as its identification, bits 1, 4 and 13 set to 1 and all other bitsset to 0. Bit 1 may be set because node B is a child node of A , forexample, bit 4 may be set to represent Europe, and bit 13 set torepresent England. Bitmap 1210 representing the attribute set for node Dof FIG. 6, a child node of B, has bits 1, 4, and 14 set to 1 and allother bits set to 0. Bit 14 may represent France, for example. Bitmap1220 representing the attribute set for node F of FIG. 6, also a childnode of B, has bits 1, 4, and 15 set to 1 and all other bits set to 0.Bit 15 may represent Germany, for example. Bitmap 1230 representing theattribute set for node H of FIG. 6, a child node of D, has bits 1, 4,and 16 set to 1 and all other bits set to 0. Bit 16 may represent Italy,for example. As discussed previously, the rolled up bitmap for node D(e.g., 1240) would be the attribute bitmap of node H(since H does nothave any children) and the rolled up bitmap of node B(e.g., 1250) is thebinary OR of Bitmaps 1210, 1220, and 1230. The result of the binary ORis that all the bits set in Bitmaps 1210, 1220, and 1230 are also set inRolled Up Bitmap 1250 (i.e., bits 1, 4,14, 15, and 16).

[0087] Content management server 570 may be connected to any node on thetree. Thus, although a content management server and a distributioncenter may not be collocated, the content management server gives thecontent provider a vehicle to upload large files (e.g., video) to thedistribution centers. In one embodiment, the content management serveris a computer that processes the content provider's large payload filefor distribution in the network. In another embodiment, the contentmanagement server may, for example, be a subset of tools (e.g., machineindependent objects) that allows upload of content to the network; thus,the tools may be shipped from a server to the content providers client'scomputer for processing and distribution of the large payload file inthe network. After a content provider loads the large payload file intothe content management server, the CMS may process the file and forwardit to the distribution center.

[0088] A simplified layout of a distribution center is illustrated inFIG. 7 in accordance with one embodiment of the present invention.Distribution center 700 comprises control unit 701, one or more VirtualFile Control System 702, one or more distribution server 703, and aplurality of storage devices (e.g., 711-713). Control unit 701 is thenetwork manager for the distribution center; its functions are furtherdiscussed in a later section. Application servers 721-724 (e.g.,streaming servers, FTP servers, and media players), which are not partof distribution center 700, are shown connected to the virtual filecontrol system 702 in this illustration to provide visibility on howend-user clients access large payload files stored in the SCDN. Thecomponents of distribution server 700 may not be collocated in the samenode. For example, VFCS 702 may be located with the application servers(e.g., 721-724), and the control unit (e.g., CU 701) may be locatedelsewhere such as with VFCS 702. Thus, it is not necessary for allcomponents of distribution center 700 be collocated at an SCDN node.

[0089] A content provider uploads a large payload file to a singlecontent management server using content publishing and management toolsrunning on a content provider client system. After receiving the file,the CMS processes the file and breaks it down, if required, into trackfiles (a.k.a. linear files). A linear file comprises a file thatmaintains the order associated with the substance (i.e., substantivecontent) of the file. If, for example, the linear file contained amovie, the beginning of that file would include the beginning portionsof the movie. Similarly, the middle and end portions of the movie wouldbe located at the middle and end of the linear file. Linear files aredesired because it is easier to reassemble such files using linearsuperposition, for example. Some media files are non-linear, that is,they contain multiple tracks such that the first part of the movie, forexample, is not stored in the beginning of the file. After breaking thefile down to linear (i.e., track) files, the CMS transfers the file tothe distribution server it is connected to. The distribution serverfurther breaks the track files down to block files, as desired forstorage. The block files may subsequently be stored in local storagelocations 711-713, for example. A file distribution protocol (e.g., FDP)command is subsequently used to distribute (i.e., replicate) the file,or selected portions thereof, to other distribution server nodes withinthe scalable content delivery network. For initial replication, theentire block files need not be stored in all nodes however a master copymay be maintained completely in one node (typically the originatingnode). The FDP includes commands to facilitate file transfers andmanipulations within the SCDN. The size of the blocks affects theperformance of both content distribution and content delivery and isdiscussed later in this document.

[0090] The Virtual File Control System (VFCS) 702 is able to piece theoriginal (large payload) file back together from the block files. Aswill be explained later, all the blocks of the large payload file neednot be stored at one distribution center, however, the entire file isavailable within the SCDN. When an end user connects to applicationserver 721 (e.g., a streaming server), the VFCS creates a virtualappearance that the entire file is available at that node. For example,assuming only fifteen percent of a two-gigabyte file is stored instorage 711-713, the VFCS makes streaming server 721 think that theentire two gigabytes is available at the location. Thus, streamingserver 721 may start playing the file. As the file is being played, VFCScommunicates with DS to locate and retrieve the remaining portions ofthe file from other nodes in the network.

[0091] Decomposing Large Files

[0092] A large payload file is divided into blocks in a number of steps,the exact process depending on whether or not it is a linear file or anon-linear file. Using a movie file for example, the file is linear ifthe first 10% of the movie is located approximately within the first 10%of the file, the next 10% within the next 10% of the file, and so on.

[0093] In contrast, a movie file in which the first 10% of the movie islocated somewhere other than in the beginning of the file is consideredto be a non-linear file.

[0094] Example linear and non-linear file structures are illustrated inFIG. 8. Data format 800 may represent the mpeg format, for example,which is linear because it contains audio/video data multiplexedtogether throughout the file in a single track, starting from thebeginning. Note that each subdivision in the various formats represent atrack hence formats 810-830 each contains multiple tracks. As shown,format 810 is non-linear because it contains header information in thefirst track of the file, followed by meta information in the next track,then video information in the third track, then meta information in thefourth track, a first audio channel in the fifth track, a second audiochannel in the sixth track, and then some control information at theend. Thus, the beginning of a movie formatted for format 810 would notreside in the beginning of the file. Formats 820 and 830 arerepresentations of other possible non-linear media data formats. Forexample, format 820 may have data formatted such that the file containsheader information in the beginning, then some 56K encoding for formatssuch as mpeg, followed by 128K encoding information. Other media format830 may contain header information, followed by index information,followed by video, and finally audio information. All these and othernon-linear files need to first be converted to linear files forcompatibility with the replication algorithm discussed later in thisspecification.

[0095]FIG. 9 shows the process of decomposing a large payload file intoblock files for storage. After the content provider uploads the fileonto the content management server (CMS), the CMS determines whether thefile is linear or non-linear. If the file is linear (e.g., block 950),such as an mpeg movie, the CMS sends the data to the DS at block 930 forthe blocking process. However, if the file is non-linear (e.g., block900), the CMS performs the Demultiplex Process at block 910 to generateLinear Track Files 920. The Demultiplex Process involves breaking up thenon-linear (i.e., multiple track) file into files containing singletracks each. For example, using the media data shown in FIG. 10 forillustration, large payload file 1000 contains header in the firsttrack, video in the second track, first audio channel in the thirdtrack, second audio channel in the fourth track, and finally controlinformation in the fifth track. The content management server breaksdown the Large payload file 1000 into five linear track files 1010 suchthat one file contains the header, a second file contains video data, athird file contains the first audio channel, and so on.

[0096] Referring back to FIG. 9, the Linear Track Files 920 or theLinear Large Payload File 950 (which is also a linear track file) are(is) transmitted by the CMS over the network to a DS that it isconnected to. The files may be transmitted in accordance with a FileDistribution Protocol (FDP), discussed below. The files from the CMS areinput to a DS-based Blocking Process 930, which produces Block Files940. The Block Files 940 are subsequently stored in the local storage ofthe DS. After processing, the content may be downloaded by otherdistribution servers in the network. Generally, there need not be adirect relationship between the size of the files transferred over thenetwork and the block files stored in the local storage system of theDS.

[0097] Blocking process 930 breaks down the track files into smaller,manageable units, as shown in block 1020 of FIG. 10. The blockingprocess produces the multiple block files H, V₁₋₄, A_(1,1-1,2),A_(2,1-2,2), and C (collectively referred to as 1020 in FIG. 10). Blockfiles may contain data overlaps or offsets (e.g., shift). For example,block file V₄ may contain some part of the Header track, and so on. Theonly requirement for the block files in one or more embodiments of theinvention is that the beginning of each track is contained in the firstblock file created for that track, for example, the beginning of AudioCh1 is contained in A_(1,1) and the beginning of Audio Ch2 is containedin A_(2,1), etc. Other embodiments may simply breakdown the largepayload file (i.e., non-linear) directly into block files without firstgoing through the demultiplexing process (e.g., block 910) thus eachblock file may contain overlapping tracks. Breaking down the largepayload file into blocks makes it possible to distribute the block filesinto different storage devices and to add more storage devices whenneeded without impacting system performance. Thus, for example, morestorage devices may be added to the distribution center (FIG. 7) withouta need to move files around or reconfigure other nodes as in the priorart. For example, different blocks may be located at different nodes ofthe SCDN hence on different storage devices. The smaller block filesmakes it possible to support multiple application servers (e.g.,streaming servers) at the same time, thereby increasing accessbandwidth. For example, multiple block files of a large payload file canbe downloaded in parallel. Fast forward and fast reverse by a user isalso possible without the entire file being first downloaded onto thestreaming server.

[0098] Reconstructing Large Payload File From Block Files

[0099]FIG. 11 is a diagram showing the process of reconstructing a largepayload file from multiple block files by the VFCS. Block files 1100 areinput to Assembling Process 1110. The reverse process of blocking,discussed in the previous section, is called “assembling”. The VirtualFile Control System (VFCS) uses assembling process 1110 to convertmultiple block files into linear track files. Assembling process 1110generates only one linear track file (e.g., Linear large payload File1150) if the original large payload file is linear. However, where theoriginal large payload file is non-linear, assembling process 1110generates multiple linear track files 1120. A linear track file isgenerated by a linear combination of the appropriate block files. Forexample, the video track file of FIG. 10 is regenerated by linearlycombining (i.e., summing) block files V₁, V₂, V₃, and V₄. Linear trackfiles 1120 may further be combined in Multiplex Process 1130 to generateNon-Linear Large Payload File 1140. The multiplexing process simplyreassembles the track files to generate the original non-linear largepayload file.

[0100] The File Distribution Protocol (FDP)

[0101] The FDP Protocol defines the file management primitives necessaryto transfer, store, and manipulate content provider files and filemetadata stored in the network. Such primitives include commands thatupload, distribute, deliver, modify, and delete files. The FDP commandsresult in one or more packets being transferred between appropriateservers in the network. It will be evident to those of ordinary skill inthe art that the command names and protocol implementation describedherein are used for convenience and that other commands or protocols maybe added, subtracted, or substituted so long as they result in efficientand reliable transfer of files within the network.

[0102] “Put”:A content provider uses content management applicationsrunning on a Content Provider Client system to upload a file (content)and file metadata (data related to the management of the files beingstored, transferred, and manipulated in the network) onto a ContentManagement Server (CMS). The CMS breaks the file into linear track filesand then issues a “put” command to a DS that will eventually distributethe content in the network. In one embodiment, the CMS is connected to aDS at an SCDN node. The CMS sends a “put” command to the DS for each ofthe track files. In effect, the “put” command is a “push” action,pushing a track from a CMS to a DS. A “put” command may include fourpackets, for example: “put”, “put_response”, “put_chunk”, and “put_ack”.The “put” packet tells the receiving DS to get ready to receive a trackfile. The “put_response” packet is a packet issued by the DS to indicateto the CMS whether or not the DS needs to receive the track file, and ifit needs it, where to begin the transmission. This packet may be usefulin the situation when a communication session is broken after part of atrack file has been transferred and the CMS needs to re-transfer theremainder part of the file. Once the DS communicates to the CMS where tobegin transferring a track file, the CMS may issue a “put_chunk” packetalong with the actual track file. The DS may respond with a “put_ack”packet when the entire track file is received to indicate successfultransmission. After receiving the track file, the DS divides the lineartrack files into block files, stores the block files in local storage,and updates the file metadata to reflect the track, block, and locationinformation.

[0103] “Distribute”:After all of the tracks have been pushed to the DS,the CMS may issue “distribute” packets directing the DS to distributethe file to other nodes in the network. For example, the CMS may issueone “distribute” packet per track file with each packet containing thecontent provider's distribution criteria. The distribution criteria, forexample, may specify which nodes in the network should have the content.The “distribute” command may include two packets, for example:“distribute” and “distribute_ack”. The DS may acknowledge receipt of the“distribute” command and track file by issuing a “distribute_ack” packetto the CMS.

[0104] “Replcate”: In response to the “distribute” command, the DS mayissue “replicate” packets to its neighbors. Each neighbor that satisfiesthe distribution criteria specified by the content provider may issue acommand (such as the “get” packet described below) to one or more DS inthe distribution path to pull a portion of the file into its localstorage. The “replicate” packet starts from the DS where the track fileshave been pushed. The “replicate” packet acts as a notification to a DSthat it may need to pull (i.e., replicate) certain block files from anyof the issuing DS into its local storage. The receiving DS mayacknowledge the notification by issuing a “replicate_ack” packet andthereafter, it assumes the responsibility of pulling the block filesfrom the issuing DS when it is ready. A DS further notifies its neighbornodes to determine if they should pull part or the entire file byissuing “replicate” packets to them. A DS may issue a replicate requestto its descendent nodes if the rolled up attribute matches the contentdistribution criteria.

[0105] “Get”:A DS that needs to pull files from another DS may issue a“get” command, for example. The “get” command may include four types ofpackets: “get”, “get_response”, “get_chunk”, and “get_ack”. For example,the “get” packet may be used to initiate a pull, and the “get_response”packet may be used to report the status of the station and transfer filemetadata as needed. The “get_chunk” packet may be used to transfer filedata and the “get_ack” packet may be used to acknowledge the end of the“get” sequence and report status. A DS may decide on the size of thefile to pull based on: (1) its storage availability; (2) location of thestation in the network map; (3) the content's popularity; (4) thetruncate-able or non-truncate-able characteristic of the file; and, (5)the bandwidth allowance. A DS may issue “get” command sequences inresponse to a “replicate” request and a “search_reply” request.

[0106] “Prepare”:A “prepare” command may include two packets, forexample: “prepare” and “prepare_ack”. The node's VFCS may issue a“prepare” packet to a DS to pull the non-resident portions of a file foran Application Server. The DS may use the “prepare_ack” packet toacknowledge that it has received the “prepare” packet and that it willperform “prepare” as soon as possible.

[0107] “Search” When the DS can process the “prepare” request, it mayissue a “search” command to locate the missing portions of a file. A“search” command may include three packets, for example: “search”,“search_ack”, and “search_reply”. A DS servicing a “prepare” commandissues a “search” packet to initiate a search among its neighbors forthe non-resident portions of the file. Each neighbor may issue a“search_ack” packet indicating that it has received the “search”request. The “search_ack” packet is not an acknowledgement that the DShas portions of the requested file. A node that has a portion of therequired file may issue a “search_reply” packet. The “search_reply”packet may include information such as the portion of the searched fileresiding in the station, the network condition of the station, and theload of the station's DS cluster. A DS in the initiating DS clusterreceives “search_reply” packets and may select appropriate remote DSnodes based on the information in the “search_reply” packets to downloadthe missing portions of the file. A DS in the initiating DS cluster mayissue “get” command, for example, to one or more stations (i.e.,selected SCDN nodes) to download the missing content.

[0108] “Remove” The “remove” command may include two packets such as“remove” and “remove_ack”. The nodes Control Unit may issue a “remove”command to the DS to remove certain blocks. The pruning process, whichis described later, uses the “remove” command. A “remove” packet is anotification to a DS that certain blocks have to be removed. The DS maysubsequently issue a “remove_ack” packet to acknowledge that it willeventually remove the indicated blocks when ready.

[0109] “Clean”:The “clean” command may include two packets, “clean” and“clean_ack”. The CMS may issue a “clean” or similar packet to notify aDS located at the same node that it needs to remove a certain file. TheDS issues a “clean_ack” or similar packet to acknowledge that the filewill eventually be removed when ready. Following the path used duringthe “replicate” command (available in the distribution criteria for thefile), the DS issues a “clean” or equivalent command to its neighboringnodes requesting deletion of the file and its related file metadata fromall the stations in the SCDN.

[0110] “Info”:The “info” command may include two packets such as “info”and “info_ack”. The CMS issues an “info” packet to transfer contentprovider metadata (data related to management of the content providersusing the SCDN) or file metadata to a DS. The packet may be used to add,delete, and modify attributes of certain content providers or files.When a DS receives content provider information, it modifies the tablewhere content provider metadata is stored within an SCDN node, issuesthe “info_ack” packet to the requester (CMS or DS), and then issues“info” command to all its neighbors except the requestor. An “info”packet that contains content provider information is propagatedthroughout the entire SCDN. An “info” packet that contains file metadatais propagated based on the distribution criteria for that file. When aCMS sends an “info” packet of a file metadata along with thedistribution criteria of the file to a DS, the receiving DS modifies itsdatabase containing the file metadata, issues “info_ack” packet to therequester (CMS or DS), and then issues “info” packet to those neighborssatisfying the distribution criteria (i.e., those that receiveddistribution of the file during the “replicate” command). This processcontinues until the database containing the file metadata in all thestations satisfying the distribution criteria are updated.

[0111] “Learn”:The “learn” command may be issued by a Control Unit'slearning agent and may be used when a DS is added to the SCDN and itslocal storage needs to be initialized, or when the station's attributechanges, or with network configuration changes, or during recovery froma failure. The DS receiving the “learn” command propagates the “learn”command to all its neighbors except the requestor. The “learn” packetcarries the attributes of the originating station. Each DS receiving a“learn” packet determines if its station has files that satisfy thelearning station's attributes, if so, it issues “replicate” to a DS inthe learning station to pull the relevant files.

[0112] “Fetch”. The “fetch” command may be used by the Control Unit'slearning agent while learning in active mode. The “fetch” command mayinclude two types of packets: “fetch” and “fetch_ack”. In activelearning mode, the learning agent obtains a list of media files to belearned, their associated content provider, and the assigned station ofthe content provider's CMS. During this time, the file metadata forthese media files are not ready in the local station and thus the DSdoes not have the information to conduct a search and download thefiles. The learning agent issues a “fetch” packet to a local DS alongwith the content's origination station. The DS in turn issues a“fetch_info” packet to a DS of the assigned station of the contentprovider's CMS. After the DS obtains the file metadata for the desiredmedia file, it stores the information into the database containing thefile metadata and returns “fetch_ack” to the learning agent. Thelearning agent may subsequently proceed to issue “prepare” commands todownload the media file.

[0113] “Fetch_info”:“Fetch_info” includes two packets, “fetch_info” and“fetch_info_block”. Each “fetch” command has encoded within it theidentification of a particular media file and a particular DS guaranteedto have the media file. In response to a “fetch” command, a DS issues“fetch_info” to the DS station identified in the “fetch”. The remote DSmay reply with “fetch_info_block”, which contains the informationnecessary to enable the local DS to save the media, track, and blockmetadata information into the local metadata database.

[0114] “Stop” The “stop” command may include two packets such as “stop”and “stop_ack”. The “stop” command is used to shutdown a DS. When a DSreceives a “stop” packet, it immediately replies with “stop_ack” anddepending on the termination requirement, the DS may shutdownimmediately or shutdown after it completes all the jobs it is executing.

[0115] Distributing Large Payload Files

[0116] To distribute a file, a content provider sets specificdistribution criteria for that file. After the distribution server (DS)stores the uploaded large payload file as blocks, the content providerrequests, through the content management server, that the DS distributethe file to other nodes in the SCDN, i.e., to push the content to theedge of the network. The distribution is in accordance with specificdistribution criteria set by the content provider and may use the filedistribution protocol (FDP) previously described. The distributioncriteria may specify regions (e.g., Europe), specific nodes, and otherinformation as desired by the content provider to control distributionof the content. For example, the distribution criteria may includeinformation found in the nodes attribute or rolled up attribute bitmap.

[0117] The file distribution proceeds as follows: (1) The DS responds tothe content provider's request to distribute a large payload file bysending a notification (i.e., a distribution request) to its neighborsto announce the existence and the distribution criteria of the file; (2)“Qualified” neighbors (i.e., those that meet the criteria) downloadseveral portions of the file during this initial distribution process;(3) The notification is then passed on from neighbor to neighbor, butnot back to the neighbor from which the distribution request isreceived; (4) Each neighbor performs steps 2 and 3 until it encounters aleaf node or a “terminating” node. Thus, the distribution of the file inthe network is done in stages.

[0118] Every node that receives a distribution request passes therequest to all its neighbors except to the “requesting” node (i.e., thenode from which it received the request). A terminating node is onewhere neither the node's attribute bitmap nor its rolled up bitmap matchthe distribution criteria and where the distribution request cannot besent to the node's parent. For any node whose attribute bitmap matchesthe content provider's distribution criteria for the file, a portion offile is downloaded from the nearest neighbors in the distribution paththat has the portion to be downloaded. Once downloaded, a DS stores thefile locally as blocks spread over different storage volumes as shown inFIG. 7, blocks 711-713. In spreading the file over several storagevolumes, the Input/Output (I/O) load is distributed across the volumesand thus increasing the overall performance of the DS during contentdistribution and, content delivery. For purposes of the invention, thestorage volumes can be any collection of storage devices, e.g., diskarrays attached to a server, RAID (Redundant Array of Independent Disks)systems, or Network Attached Storage (NAS)), or Storage Area Network(SAN).

[0119]FIG. 13 is an illustrative embodiment of the distribution of alarge payload file within an SCDN. A content provider uploads a largepayload file into the content management server (CMS) 570, which isconnected to node B of the SCDN, using any content publishing andmanagement software running on the content provider's client system(CPC) 530. The content provider also uploads the distribution criteriaonto CMS 570. Content management server 570, as previously described,divides the uploaded file into track files and issues a command similarto the FDP “put” command for each track file to the distribution serverlocated in node B. In other embodiments, the CMS may be connected to anynode of the SCDN. At node B, the DS divides the track files into blockfiles for local storage. The full copy of the file is shown at Node B asa filled in dot. The CMS then issues an FDP command of the type“distribute” to the distribution server at node B. In response to thedistribute command, the DS issues a command to its neighboring nodes A ,D, and Eto replicate the content (e.g., using the “replicate” command ofthe FDP). Node Dexamines the replicate packet and decides its notsupposed to have the content thus it passes the replicate command to itsneighbor, node H. Nodes A , E, and Hexamine the replicate packet anddecide they all match the distribution criteria (i.e., they are“qualified” nodes). When ready, nodes A, E, and H issue commands toretrieve a portion of the file from the nearest node (e.g., node B) inthe SCDN. Nodes E and Hare leaf nodes thus they do not propagate thereplicate command. However, node A is the root node with child nodesBand C. Node A may not send the replicate command back to node B,because it is the originating node. However, node A may send thereplicate request to node C. Node C checks the distribution criteria anddecides it's a qualified node therefore it retrieves a portion of thefile from the nearest nodes (e.g., the nearest of nodes A, B, E, and H)containing the needed data. Node C subsequently sends the replicatecommand to nodes F and C. Node F is qualified thus it retrieves aportion of the file from the nearest nodes having the data (e.g. nodes Bor C). Nodes C and /are not qualified thus they receive nothing. Node Gis a terminating node because the rolled-up attribute of its branch doesnot satisfy the distribution criteria. This initial replication processcontinues until all the qualified nodes in SCDN are at least partiallypopulated. In one or more embodiments, the same portion (e.g., blocks)of the large payload file is contained in at least one node of the SCDN.Preferably, a plurality of nodes maintains the same portion therebycreating redundancy and preventing loss of any portion of the largepayload file when one or more nodes or storage volumes becomeunavailable. For example, when a storage volume (or device) becomesunavailable (i.e., lost), a DS at that station need not take any specialaction to recover contents of the damaged volume since the portions oflarge payload files stored and hence lost in that volume areautomatically downloaded from other network nodes upon demand to servicea user request. The distribution servers also relay control informationof a failed station to neighbors of the failed station to preventimproper termination of control commands.

[0120] During normal operation, a Distribution Server sends FDPcommands, such as replicate, info, search, and clean commands that areforwarded to all or part of the network, through other DistributionServers in the immediate neighbor stations in its control path. Forexample, when a Distribution Server receives an FDP command such asreplicate or info, it sends the command to its neighbor DSs based on theFDP distribution criteria. In the situation when one of the neighborstations is failed, the DS keeps the job in its job queue, andrepeatedly retries until the job is successfully completed. At the sametime, the DS temporarily assumes the role of the DS in the failedstation by forwarding the FDP command to the neighbor DSs of the failedstation.

[0121] The FDP uses the content provider's distribution criteria todirect the distribution of the large payload file in whole or in part toall nodes in the network meeting the provider's distribution criteria. Adistribution request can start from any node in the tree, and traversesup and down the tree until it reaches a leaf node or arrives at aterminating node. For any node having the appropriate attributes, thefile is partially downloaded from the nearest neighbors that meetspecific performance criteria if those neighbors contain the portion ofthe file to be downloaded. The nearest neighbor when downloading contentis not necessarily the nearest in the virtual tree but nearest in termsof distance. This prevents massive transfers from the node at which thefile is initially uploaded. Moreover, the staging nature of thedistribution prevents excessive demands on the network around theinitial node (e.g., node B). By delivering smaller blocks and only apartial file this delivery method reduces network load. Additionally,because the distribution requests stop progressing through the SCDN whenthey arrive at a “terminating” node, the present invention preventsunnecessary distribution request packets from flooding the network.

[0122] Accessing Large Payload Files

[0123] An end-user may request access to a large payload file (e.g., amovie) via an interface, such as a Web-browser, on the end-user's clientsystem. The request is forwarded to an appropriate Application Server(i.e., one that is closer to the end-user and with bandwidth to servicethe request) that will provide the file to the end-user, e.g., aStreaming Server for delivering large video files, or an FTP Server fordelivering large, media rich documents, or any media player that iscapable of mounting the VFCS as its remote file system in order to haveaccess to content in the SCDN. The application server is in the networkand thus may be connected to the nearest node of the SCDN. The SCDNnode's storage volumes (i.e., cache memory) may contain some, none, orall of the blocks of the end-user's requested file. If either additionalor the full content of the file is needed at the Application Server, theSCDN node's VFCS communicates with a local DS to issue a search request,on behalf of the Application Server, to all the DS's neighbors to locatethe needed (non-resident) portions of the file.

[0124] For example, assume the requested large payload file is 10 Gbytesin length, corresponding to a total of 20 blocks of 500 Mbyte storage(i.e., if each block is 500 Mbyte). Further, assume only 6 such 500Mbyte blocks reside locally within the SCDN node. Even though only 3Gbytes of the requested file are actually stored in the SCDN node'sstorage system, the entire file “appears” to exist locally to theApplication Server via the VFCS. At the request of the VFCS, thenon-resident portions of the file are pulled from different distributionservers in the SCDN and stored locally as the Application Server streamsthe file to the end-user. Portions of the file might be retrieved fromseveral distribution servers concurrently. Typically, data received overthe SCDN are stored as blocks in the shared Storage (e.g. local storagevolumes). The VFCS assembles and multiplexes the stored block files intothe 10 GByte file in real time so the Application Server can use it(e.g., stream the file to the end-user).

[0125] To locate the non-resident portions of the file, a DS in acluster of DSs issues a search request that traverses the SCDN tree,starting from its neighbor nodes. The search request may include thedistribution criteria of the requested file and a time-to-live counter.A time-to-live counter may, for example, specify that the search requestneed only traverse two hubs of the SCDN from the requesting node. When aneighbor node receives and evaluates the search request, the node maydecrement the counter, for example. A search request terminates when itencounters a leaf node, a “terminating” node or the time-to-live counteris zero (i.e., where the search request includes a counter). Where themissing data is not located and the time-to-live counter reaches zero,i.e., if it is included in the search request, the search requestcontinues by traversing the SCDN nodes in the reverse path of theinitial distribution process. A node replies directly to the requestingDS if the requested part of the file exists in that node. Nodes nothaving any portion of the requested file do not reply. A reply alsoincludes the performance status of the node that sends the reply and theportions of the file available. When the requesting DS cluster receivesreply packets from any nodes in the SCDN indicating that they containpart or all of the requested file, the DSs in the cluster download themissing content from those nodes that are least congested and stores itlocally in the distribution server's shared storage volumes. Thus, asthe application server is providing the data to the end-user, thedistribution servers are obtaining the remainder of the file from othernodes and there is no break in the communication between the applicationserver and the VFCS.

[0126] As discussed earlier, a large payload file is broken down intoportions (e.g., block files) and distributed throughout the SCDN. Thus,when nodes that contain portions of the file are found through thesearch request, a cluster of DSs can download portions of that file inparallel from multiple nodes, especially from those nodes that arecurrently the least congested. The initiating DS cluster decides, basedon the performance information in the reply packets, where to download(i.e., “pull”) missing content so as to minimize the latency andbandwidth demands on other distribution server nodes.

[0127] Content portions are pulled from the appropriate distributionservers and assembled in real-time for the end-user by the VFCS, runningon one or more VFCS Servers. The VFCS enables the Application Servers toview the distributed storage volumes that exist in the SCDN as a single,large virtual file system.

[0128] Retrieving Non-Contiguous File Segments

[0129] From one perspective, each stored block in the system storage ofan SCDN node corresponds to a contiguous segment of a large payload file(e.g., a contiguous interval of movie). For example, the segments thatcomprise a movie, if viewed one after the other from the first segmentto the last segment, would result in viewing the entire movie. Since thesame content portions (i.e., segments) are located at several differentnodes in the SCDN, non-contiguous segments of a file (e.g.,non-contiguous portions of a film) can be retrieved independently and inparallel. This has several important side effects. For example, since aDS can obtain needed content portions from several differentdistribution servers, the reliability and availability of the SCDN aresignificantly increased. Additionally, the end-user can efficientlyaccess segments of a large payload “out-of-order”, e.g., fast-forwardingof a movie can be realized without actually having to download all ofthe portions of the film that are not actually viewed. Importantly,pruning (freeing the storage used by some blocks for use by otherblocks) can be done at the “block level” (versus the entire “filelevel”) based on specific content provider policies, e.g., pruning canbe based on usage patterns.

[0130] Usage of the content can also be rated at the block level.

[0131] Block Size and File Distribution

[0132] The size of the blocks affects the performance of both contentdistribution and content delivery. Several important factors areconsidered in determining a block size:

[0133] 1) Ethernet MTU (Maximum Transmission Unit) size, 2) the size ofthe physical units of storage, 3) the time required to transfer a block(which is related to the network bandwidth), and 4) the shortestacceptable period to be skipped in response to a fast forward or rewindcommand during content delivery (this is called the minimum flashinterval).

[0134] Several goals come into play in determining the block size. Onegoal is to maximize space usage within an MTU, which would make contentdistribution more efficient. Another goal is to minimize congestion atthe distribution nodes. Another important goal for determining blocksize is to prevent storage fragmentation, since fragmentation degradesfile system performance, again consistent with achieving the othergoals.

[0135] Block sizes that are too big or too small can affect performance.Consider the fast forward command, for example. If the block size weretoo big, server response to fast forward requests during a downloadwould be sluggish, as the server has to finish downloading theparticular block file before it can process such requests. Conversely,if the block size were too small, fast forwarding to the end of theblock would be very quick. If the block size is within the minimum flashinterval, another distribution server can respond to fast forwardrequests by retrieving the block containing the target content.

[0136] Based on the above criteria, assumptions made about the physicalnetwork that supports the SCDN, and assumption relating to the size ofthe flash interval and minimizing network congestion, the block size ina one embodiment may be 256 Kbytes, for example. It will be evident tothose of ordinary skill in the art that the block size could change whenone or more of the assumptions change and that the value may beimplementation and application specific.

[0137] Additionally, the block size in the storage of a delivery networkdoes not have to be a constant. Each DS in the network may have its ownsetting depending on the specific nature of the storage devices and itsnetwork condition. Each file may have a different block size.

[0138] The number of blocks distributed to a qualified node during theinitial file distribution phase is determined by a number of factors,including the distance from the originating DS (i.e., where the file wasuploaded) to the node, the front and back end bandwidth of the node (thecurrent network conditions), predicted network conditions, the historyusage information of the node, a “popularity” index set by the contentprovider, as well as the storage available at that node to the contentprovider.

[0139] Scalability and Adaptability (Learning and Pruning)

[0140] A SCDN in accordance with an embodiment of the present inventionis highly scalable. For example, when a new node is added to the SCDN,it downloads the initial content it needs by employing one of severaldifferent adaptable initialization processes. In one embodiment of theinvention, an “Auto-initialization” process is used. When a node isadded to an SCDN, it is given a set of attributes. In theauto-initialization process, as soon as the node is connected to thenetwork, it issues an FDP “Learn” or similar request to all itsneighbors. The node encodes its attributes in the learn request. Theneighbors offer content, consistent with the new node's attributes, toit for downloading. The neighbors then pass on the new nodes learnrequest to all of their neighbors, which take similar action. Thus, thenew node's learn request traverses the entire network and all the nodesin the network respond to the learn request if they have contentsappropriate for the new node. The new node collects all the information,downloads the necessary initial contents, and is now a functioningelement of the SCDN.

[0141] An example of this auto-initialization process will be discussedin the context of FIG. 25, which illustrates new node J added to theSCDN. A learn request is initiated by node J as soon as it is connectedto the SCDN. It issues the learn request, which contains its attributebitmap, to all its neighbors.

[0142] In this example, there is only one immediate neighbor, node C.When node C receives the “learn” request, it compares node J's attributebitmap to the distribution criteria of its own content. Node G repliesto node J if it has any appropriate content for node J to download. NodeG then passes the learn request to all its neighbors (i.e., Nodes/and C)other than node J, the initiating node. Each node to which the requestis passed likewise evaluates the learn request, conditionally replies,and propagates the request in accordance with the foregoing. The learnrequest terminates when it encounters a leaf node or a “terminating”node.

[0143] As the learn request traverses the SCDN, all the nodes respond tonode J if they have contents that node J should have. Finally, node Jcollects all the response information and downloads the necessaryinitial contents from the nodes that can most optimally supply them.Node J is now available to service content delivery requests.

[0144] There are additional situations in which learning and adaptationprocesses may be used in other embodiments of the invention. Forexample, as a large payload file is accessed, VFCS serves the content toApplication Servers (such as Streaming Servers), while it alsocommunicates with distribution servers to pull missing content portionsfrom other locations. As more and more content portions are downloadedto satisfy end-user requests, the storage space for each contentprovider must be carefully monitored. Based on storage availability andusage information collected by VFCS, a pruning process could be used toremove certain blocks of media files. The policy associated with thepruning process should address: (1) when to prune, (2) how much toprune, and (3) which blocks to prune. After pruning, a server's storagesystem may contain entire media files or non-contiguous segments offiles that are accessed frequently by local users. Additionally, thecontent provider might be apprised that more storage or moreDistribution Servers, Application Servers, or VFCS Servers should beadded to the network.

[0145] Scalable Content Delivery Network with Stations

[0146]FIG. 14 is an illustrative example of another embodiment of theScalable Content Delivery Network. SCDN 1400 is essentially the same asSCDN 500 (see FIG. 5) with the individual Distribution Centers andindividual Application Servers of SCDN 500 replaced by a plurality ofSCDN Stations 1410 and a Central Station 1420.

[0147] As in the earlier embodiments, the stations of SCDN 1400 areorganized in a logical virtual tree structure in which each node in thetree has a set of attributes. Thus, each Station has an attribute setthat is stored in the node and can be represented in any convenient datastructure, e.g., the attribute set can be represented as an attributebitmap. Furthermore, each Station (i.e., node) also contains arepresentation of the rolled up attribute set of each of the station'schild-Stations. This representation is called the “Rolled Up Set ofAttributes” and any convenient data structure can be used for it, e.g.,a “Rolled Up Bitmap”, which may be the defined as the “binary OR”combination of all rolled up attribute bitmaps from the child-Stations.The distribution servers within a Distribution Server Cluster use theattribute bitmap to distribute and route portions of large payload filesand they use the aggregated rolled-up attribute bitmap to terminateunnecessary propagation of messages. One of the Stations in an SCDN isdesignated the “Central Station”. The Central Station holds an attributedatabase table that matches text strings to bit positions, e.g., areference table. Central Station 1420 is not necessarily a datarepository for all content but may contain some or all the content.

[0148] In one or more embodiments of the present invention, an SCDNstation (a.k.a. “Data Center”) may be configured as shown in FIG. 15.Station 1410 includes a Distribution Server Cluster (DSC) 1510, anApplication Server Cluster (ASC) 1520, a Control Unit (CU) 1550, ashared Storage System 1530, a Storage Switch 1540, and Intra-StationControl related Switch 1515. The distribution server cluster 1510communicates with storage system 1530 through storage switch 1540 usingcommunication links 1541 and 1544. The application server cluster 1520communicates with storage system 1530 through storage switch 1540 usingcommunication links 1543 and 1545. The control unit 1550, distributionserver cluster 1510, and application server cluster 1520 all communicatethrough intra-station control related switch 1515, which communicateswith storage switch 1540. The control unit has its local storage system1560. The various components will be discussed in more detail later inthis specification.

[0149]FIG. 16 provides an alternate illustration of the SCDN of FIG. 14.FIG. 16 is an abstract representation of the Internet. Comparable to thenetwork core 505 of FIG. 14, high-speed backbones 1605-1 through 1605-N,generally owned and operated by long-haul communications providers, arecoupled via peering point 1610-1 (and other peering points not shown).Telecom Access Facility 1650, Server Farm Facility 1640, CorporateNetwork 1630, and Co-location Facility 1620, arrange with one or morelong-haul communications providers to gain access to one or more of thebackbones. Each of these major facility types generally providesfractional access to the backbones to secondary companies, groups, andindividuals under a wide variety of arrangements. (Telecom AccessFacility 1650, should be construed to included such telecommunicationvariants as Internet Service Providers providing Dial-up Analog Modemaccess, Cable System Head Ends providing cable modem access, andTelephone Company Central Offices providing DSL and other datacommunication variants.)

[0150] As shown, end-user client systems (e.g., EUC 1655 and EUC 1639),generally access or provide email, web-pages, and other Internet-basedresources, via Telecom Access Facility 1650 or via connection throughsubsidiary portions of corporate networks 1630. CPCs (e.g., 1636)generally upload content via connections within a corporate network,although access via a telecom access facility is also common.

[0151] The station specific local network 1621 may include one or morehubs, switches, or routers that interface the station components to thenetwork within the facility where the station is located. The exactconfiguration of station specific local network 1621 is a function ofthe scale of the station configuration (i.e., the number of eachparticular kind of server and the number of storage volumes), thevarious traffic flows expected for each station component, and theparticular details of the facility where the station is located. Whilethe station is shown at co-location facility 1620, this is merelyillustrative, as the station could be located anywhere within the largernetwork.

[0152] Distribution Server Clusters

[0153] A Distribution Server Cluster (DSC) provides, among other things,system fault tolerance and scalability. FIG. 17 is an illustration of adistribution server cluster configuration. DSC 1510 includes a pluralityof Distribution Servers 1710-1 through 1710-N (collectively, 1710) and aLoad Balancer 1720. The distribution servers, 1710, access data (e.g.,Block Files) on Storage Volumes 1730-1 through 1730-V (collectively,1730) in the shared Storage System 1530 via Switch 1540. A DS (e.g., DS1710-1) in the distribution server cluster may issue a request (e.g., asearch request) to a DS of a neighbor station via requests that arecomponents of Outbound Traffic 1740. Similarly, a DS of a neighborstation may issue a request (e.g., a learn request) to a DS within DSC1510 via requests that are components of Inbound Traffic 1750. The LoadBalancer 1720 dispatches the Inbound Traffic 1750 to one of thedistribution servers 1710-1 through 1710-N. Load Balancer 1720 may beimplemented as a load balancing router in various topologicalcombinations with a standard router and may also handle the outbound DSTraffic (e.g., 1740).

[0154] Each DS treats its requests (search, learn, etc.) as jobs to beexecuted. The jobs are stored and managed in Job Queues 1760-1 through1760-N (collectively, 1760) in the memory (e.g., random access memory)of each respective server. job Queue Images 1770-1 through 1770-N(collectively, 1770) corresponding respectively to job Queues 1760-1through 1760-N, are stored in a database in the Storage System 1530. Asdiscussed below, the station's Control Unit (CU) 1550 manages this and anumber of other databases in Storage System 1530. Note that the databasecontaining Job Queue Image 1770 is mapped onto Storage Volumes 1730merely for convenience in making the illustration. It should be apparentto those of ordinary skill in the art that the Job Queue Image databaseand other SCDN-related databases may be mapped onto any availableStorage Volumes.

[0155] Each DS periodically registers a “heartbeat” in a Control Unitdatabase and, periodically, they watch for each other's heartbeat.During startup (e.g., power-up), the distribution servers in a DSC votefor a “Master Server”. If, for example, DS 1710-1, misses h heartbeats,where h is a configurable parameter, it is assumed that DS 1710-1 is nolonger functioning. The Master Server then re-distributes the jobsassociated with DS 1710-1 to the active (i.e., living) distributionservers within the DSC. If the Master Server ceases to function, all theliving distribution servers vote for a new Master Server. The new MasterServer then re-distributes the previous Master server's orphaned jobs,if any exist.

[0156] In the event that the Control Unit's database is no longeraccessible, the distribution servers function as usual except that theirjob queues are mirrored to the local storage of each individual servermachine. During this time, it could happen that either a DS's job queuedatabase cannot be accessed or a DS crashes. If either event occurs, theserver machine would eventually need to be re-started. It would thenread and recover all the jobs saved in its local file system prior tothe failure.

[0157] Application Server Clusters

[0158] An Application Server Cluster (ASC) provides, among other things,services to the end-user (e.g., streaming a full-length movie to anend-user's client system), while providing system fault tolerance andscalability. FIGS. 18A through 18C provide three illustrativeembodiments of the application server cluster. Across all threeembodiments, ASC 1520 includes Load Balancers 1820 and 1830, a pluralityof Application Servers 1810-1 through 1810-M (collectively 1810), and aplurality of VFCS Servers 1840-1 through 1840-L (collectively 1840). Theapplication server clusters provide fault-tolerant and scalable systemperformance. For example, if one of the Application Servers fail or ifone of the VFCS Servers fail, one of the other existing ApplicationServers or VFCS Servers, respectively, will process the requests.Similarly, if more system performance is required, the ApplicationServers, VFCS Servers, or storage capacity of the Storage System can beincreased as required.

[0159]FIG. 18A is an illustrative embodiment of the Application ServerCluster 1520 of FIG. 15. Each Application Server 1810 accesses data(e.g., large payload files) via one of the station's VFCS Servers 1840,which in turn access data in the Storage System 1530 via Switch 1540.Although they are shown logically as two separate units in FIG. 18A,Load Balancer 1820 and Load Balancer 1830 may be the same physical unit.Also, Application Server 1810 and VFCS server 1840 may be contained inthe same physical unit thereby eliminating one of load balancers 1820and 1830.

[0160] An end-user requests a large payload file using a standardinterface (such as a web browser) that is running on the end-user'sclient machine. As a result, a service request for the file is sent toan ASC and arrives at Load Balancer 1820. The inbound data packets forthe service request are forwarded by Load Balancer 1820 to one of theApplication Servers 1810, e.g., Application Server 1810-1 (an arbitraryillustrative one of 1810-1 through 1810-M). Application Server 1810-1issues a request for the required data to Load Balancer 1830. LoadBalancer 1830 selects one the of station's VFCS Servers 1840, e.g., VFCS1840-3 (an arbitrary illustrative one of 1840-1 through 1840-L), tohandle the request and forwards the data packets from Application Server1810-1 to VFCS 1840-3. Assuming all of the requested data is present inStorage System 1530, VFCS 1840-3 processes the request by accessing thedata in Storage System 1530 via Switch 1540 and sends data and responseback to Application Server 1810-1 via Load Balancer 1830.

[0161] When Application Server 1810-1 establishes a session with VFCS1840-3, Load Balancer 1830 continues to forward data back and forthbetween Application Server 1810-1 and VFCS 1840-3. If Load Balancer 1830supports the previously described (i.e., in the background section)“sticky” feature and the “sticky” feature is turned “on”, data fromApplication Server 1810-1 may continue to be directed to VFCS 1840-3beyond the current session, if VFCS 1840-3 remains available (i.e., ifLoad Balancer 1830 does not allocate VFCS 1840-3 to another ApplicationServer). When VFCS 1840-3 becomes unavailable, Load Balancer 1830directs data packets from Application Server 1810-1 to another VFCSServer, e.g., VFCS 1840-1 (another arbitrary illustrative one of 1840-1through 1840-M). VFCS 1840-1 processes the request from ApplicationServer 1810-1 and sends response data packets to Application Server1810-1 via Load Balancer 1830. Data packets from Application Server1810-1 are sent back to the client via Load Balancer 1820. Just likeLoad Balancer 1830, Load Balancer 1820 maintains a persistent sessionbetween the end-user's client system and Application Server 1810-1. LoadBalancer 1820 may also provide the “sticky” feature.

[0162] When a new request from a different end-user client systemarrives at Load Balancer 1820 of the ASC, Load Balancer 1820 forwardsthe new request to an available Application Server, e.g., ApplicationServer 1810-3 (another arbitrary illustrative one of 1810-1 through1810-M). Application Server 1810-3 processes the request and in turnmakes a data request to one of the station's VFCS Servers via LoadBalancer 1830, e.g., VFCS 1840-2 (another arbitrary illustrative one of1840-1 through 1840-L). Load Balancer 1830 then forwards the datapackets from Application Server 1810-3 to VFCS 1840-2. VFCS 1840-2processes the request from Application Server 1810-3 and sends responsesback to Application Server 1810-3 via Load Balancer 1830. ApplicationServer 1810-3 sends responses to the new end-user client system via LoadBalancer 1820.

[0163]FIG. 18B is another illustrative embodiment of the ApplicationServer Cluster 1520 of FIG. 15. The embodiment of ASC 1520 in FIG. 18B,includes one or more Application Servers 1810-1 through 1810-M(collectively 1810), Load Balancer 1820 with low bandwidth capability,Router 1825 with high network throughput, Load Balancer 1830 (also withlow bandwidth capability), Router 1835 and one or more VFCS Servers1840-1 through 1840-L (collectively, 1840). Each Application Serveraccesses data (e.g., large payload files) via one of the station's VFCSServers 1840, which in turn accesses data in Storage System 1530 viaSwitch 1540. Although they are shown logically as two separate units inFIG. 18B, Load Balancer 1820 and Load Balancer 1830 may be the samephysical unit, and Router 1825 and Router 1835 may be the same physicalunit. Also, Application Server 1810 and VFCS server 1840 may becontained in the same physical unit thereby eliminating one of loadbalancers 1820 and 1830 and routers 1825 and 1835. Thus, a configurationaccording to an embodiment of the present invention eliminates loadbalancer 1830, router 1835, and combines application server 1810 withVFCS server 1840.

[0164] The present embodiment leverages the fact that the outboundtraffic from both the VFCS Servers 1840 and the Application Servers 1810of the application server cluster is significantly higher than theinbound traffic. As shown in FIG. 18B, the outbound traffic is sent toRouter 1825 and Router 1835 and Load Balancer 1820 and Load Balancer1830, while the inbound traffic is sent to the load balancers and notthe routers. By separating the inbound and outbound traffic, thisembodiment contributes to network performance improvement.

[0165] An end-user requests a large payload file using a standardinterface (such as a web browser) that is running on the end-user'sclient machine. As a result, a service request for the file is sent toan ASC and arrives at Load Balancer 1820. The inbound data packets ofthe service request are forwarded by Load Balancer 1820 to one ofApplication Servers 1810, e.g., Application Server 1810-1 (an arbitraryillustrative one of 1810-1 through 1810-M). Application Server 1810-1issues a request for the required data to Load Balancer 1830. LoadBalancer 1830 selects one of VFCS Servers 1840, e.g., VFCS 1840-1 (anarbitrary illustrative one of 1840-1 through 1840-L), to handle therequest and forwards the data packets from Application Server 1810-1 toVFCS 1840-1. Assuming all of the requested data is present in StorageSystem 1530, VFCS 1840-1 processes the request by accessing the data inStorage System 1530 via Switch 1540 and sends the data and a responseback to Application Server 1810-1 via Router 1835.

[0166] When Application Server 1810-1 establishes a session with VFCS1840-1, Load Balancer 1830 continues to send data from ApplicationServer 1810-1 to VFCS 1840-1. If Load Balancer 1830 supports the“sticky” feature and that feature is turned “on”, data from ApplicationServer 1810-1 may continue to be directed to VFCS 1840-1 beyond thecurrent session, so long as VFCS 1840-1 remains available (i.e., if LoadBalancer 1830 does not allocate VFCS 1840-1 to another ApplicationServer). The data from VFCS 1840-1 to Application Server 1810-1 flowsthrough Router 1835. Router 1835 forwards data packets it receives fromVFCS 1840-1 to Application Server 1810-1. Application Server 1810-1sends data packets to the end-user client system via Router 1825.

[0167] When a new request from a different end-user client arrives atLoad Balancer 1820 of the ASC, Load Balancer 1820 forwards the newrequest to an available Application Server, e.g., Application Server1810-3 (another arbitrary illustrative one of 1810-1 through 1810-M).Application Server 1810-3 processes the request and in turn issues adata request to one of the VFCS Servers via Load Balancer 1830, e.g.,VFCS 1840-3 (another arbitrary illustrative one of 1840-1 through1840-L). VFCS 1840-3 processes the request from Application Server1810-3 and sends data back to Application Server 1810-3 via Router 1835.Application Server 1810-3 sends response data back to the end-userclient system via Router 1825.

[0168]FIG. 18C is a third illustrative embodiment of the ApplicationServer Cluster 1520 of FIG. 15. This embodiment, which is quite similarto the embodiment of FIG. 18B, differs in two important aspects: (1) allEUC-related data traffic in and out of the ASC passes through Router1825 and (2) all data traffic between application servers 1810 and theVFCS Servers 1840 passes through Router 1835.

[0169] Inbound client data packets flow through Router 1825 to LoadBalancer 1820. Load Balancer 1820 then dispatches the inbound traffic tothe Application Servers via Router 1825. All outbound traffic flowsthrough Router 1825 to the end-user client system. Inbound traffic tothe VFCS Servers flows from Router 1835 to Load Balancer 1830 and LoadBalancer 1830 dispatches the inbound traffic to the VFCS Servers viaRouter 1835. VFCS Server outbound traffic flows through Router 1835 tothe corresponding Application Servers. Again, Load Balancer 1820 andLoad Balancer 1830 may be the same physical unit, and Router 1825 andRouter 1835 may be the same physical unit. Also, Application Server 1810and VFCS server 1840 may be contained in the same physical unit therebyeliminating one of load balancers 1820 and 1830 and routers 1825 and1835. Thus, a configuration according to an embodiment of the presentinvention eliminates load balancer 1830, router 1835, and combinesapplication server 1810 with VFCS server 1840.

[0170] The embodiment of FIG. 18A requires the least hardware. Moreover,it requires a load balancer with enough capacity to handle both inboundand outbound traffic cluster. The embodiments of FIGS. 18B and 18C haveobvious advantages for clusters with heavy outbound traffic and lowerinbound traffic. Both require two small capacity load balancers. In theembodiment of FIG. 18B, the inbound and outbound traffic is splitbetween the load balancers and routers, while in the embodiment of FIG.18C, the inbound and outbound traffic goes through the routers, whichuse the load balancers as a resource. For application server clusterswith heavy two-way traffic, smaller capacity load balancers and routersare desired such as in the embodiments of FIGS. 18B and 18C. Theembodiments of FIGS. 18B and 18C may be configured using load balancersthat can operate in transparent mode.

[0171] The Virtual File Control System (VFCS) Protocol and VFCS Servers

[0172] How a VFCS Server processes an Application Server's file requestif all of the requested data is present in the Station's Storage Systemwas discussed in the immediately preceding section. What a VFCS Serverdoes if all of the requested data is not present in the Station'sStorage System is now discussed in the context of FIG. 19.

[0173] Assuming that VFCS 1840-3 is processing requests for ApplicationServer 1810-1. If either additional or the full content of the requestedfile is needed by Application Server 1810-1, VFCS 1840-3 seeks theassistance of a distribution server in the Station's distribution servercluster (e.g., 1510) to retrieve the missing content. This communicationmay be accomplished using intra-station data communication over a paththat includes Intra-Station Control-Related Switch 1515, datacommunications path 1901 between Load Balancer 1720 and Switch 1515, anddata communications path 1910 between VFCS Servers 1840 and Switch 1515.It will be evident to those of ordinary skill in the arts that the pathjust described is merely illustrative and that many other means foraccomplishing the required communication may be used.

[0174] VFCS 1840-3's request to the DSC is input to the Load Balancer1720. The load balancer (e.g., 1720) then selects an availabledistribution server, e.g., DS 1710-2 (an arbitrary illustrative one of1710-1 through 171-N), to service the request. DS 1710-2 issues a searchrequest as a component of Outbound DS Traffic, on behalf of theApplication Server 1810-1, to each of its neighbor Stations to locateand download the needed portions of the file. This searching anddownloading process has been described above.

[0175] When DS 1710-2 receives reply packets from the neighboringStations indicating that they contain part of or the entire requestedfile, distribution servers 1710 in DSC 1510 will download the missingcontent from those Stations that are least congested and stores itlocally in Storage System 1530 via Switch 1540. VFCS 1840-3 thenprocesses Application Server 1810-1's request by accessing the data inStorage System 1530 via Switch 1540 and sends data and response back toApplication Server 1810-1 via Load Balancer 1830.

[0176] The Content Repository of an SCDN station may include severalstorage volumes (see FIG. 7). During access of a content file via VFCS1840, if the VFCS detects that all the block files that make up therequested content file are not available locally, it signals the DSC1510 via an FDP prepare command to download the missing portions fromother SCDN nodes. A DS in the DSC 1510 issues an FDP search command toDSs in its neighbor nodes in attempts to locate and download the missingblock files from the least congested stations. As the block files aredownloaded, the metadata of the content file is updated to register theexistence of the block files in the local storage volumes.

[0177] In the event of failure of local storage volumes, data residentin the local storage volumes that are destroyed are treated as if theyare missing by the VFCS. Hence, when a storage volume is destroyed, andaccess to some block files of a content file is requested, the VFCS willdetect that the block files are not accessible and signal the DSC thatthe block files are missing via the FDP prepare or similar command. A DSin the DSC simply assumes that the block files do not exist locallyunder this situation, thus it searches for the missing blocks in theSCDN network. When the missing data is located, the DSs in the DSCdownload the missing blocks and then update the file metadataaccordingly. Over time, block files on destroyed storage volumes areautomatically recovered and stored in the good storage volumes.

[0178] In order to achieve the VFCS functions described in this andprevious sections, the VFCS can be implemented either as a stackablefile system, as a proxy file server using an underlying network filesystem such as NFS or CIFS, or as a storage area network, or directattached storage, or as a combination of these methods. One suchimplementation in which VFCS is a proxy file server using the NFSprotocol as an underlying network file system protocol is described.

[0179] One of the main tasks of the VFCS is to reassemble block files inreal time before sending them back to an Application Server such thatthe Application Server thinks that file I/O is done on a single file. Inone embodiment of the invention, the Application Server may use the NFSprotocol to communicate with the VFCS. In the NFS Protocol, a NFS clientneeds to obtain the file handle for the root of a file system before thefile can be accessed remotely. A NFS client uses the NFS “mount”protocol to obtain a “file handle” from a remote physical file system.The NFS mount protocol allows the server to hand out remote accessprivileges to a restricted set of clients and to perform variousoperating system-specific functions that allow, for example, attaching aremote directory tree to a local file system.

[0180] The VFCS enables the Application Servers to view the distributedstorage volumes that exist within the SCDN stations as a single, large,distributed virtual storage system via the VFCS distributed virtual filesystem. While the VFCS does not actually provide the Application Serverswith direct (physical) access to the real disk files, each VFCS Servermay do an NFS mount in such a way that the Application Server it isserving perceives the VFCS distributed virtual file system as beingphysically mounted on the VFCS. To achieve this, each VFCS Server actsas both NFS server and NFS client at the same time when performing asingle file I/O request for an Application Server. Each VFCS Server hasto support the NFS mount protocol when its role is as an NFS server andit must do an NFS mount as a client when accessing files from thestation's Storage System devices, such as NAS devices. Thus, there aretwo different “mount” operations supported in VFCS to achieve file I/Otransparently with respect to the Application Servers.

[0181] VFCS Server File System Overview

[0182] When each VFCS Server is initialized during its startupprocedure, a VFCS mount daemon initializes a locally instantiated(private to each VFCS Server) “File System” via the NFS mount procedure.The file system does not necessarily exist physically on any attachedstorage devices. In an illustrative embodiment, a private file systemexists in the main memory (e.g., some variant of Dynamic Random AccessMemory) of each VFCS Server. Each VFCS server's private file system usesa “VFCS name space” that is identical across all the VFCS Servers. Thatis, each VFCS Server references the files held in the shared SystemStorage using a common hierarchy and naming protocol. More specifically,every file in each VFCS server's private file system tree has a commonand unique locator (path name) and handle. This common VFCS name spaceallows each file mounted at the station to have a unique content locator(filename) associated with it. This allows the same filename to be usedby all of the station's VFCS Servers with identical result. Thus all ofthe VFCS Servers within a Station have equal access to the entirecollection of large payload files that are mounted at the Station.Whenever an Application Server invokes its VFCS Client (i.e., a VFCSaccess routine running on the Application Server) to mount thedistributed virtual VFCS, the root file handle of the distributedvirtual VFCS file system in the station's Storage System is returned.This root file handle is then used to access large payload files in thedistributed virtual VFCS. Because all of the station's VFCS Serversaccess the identical VFCS name space, any VFCS Server could use the roothandle. In the event a VFCS Server crashes, the VFCS Client (running onthe Application Server) retries accessing the requested file using theroot file handle. Transparent to the Application Server, the retryrequest is routed to a different VFCS Server. The file handle thusoffers a persistence feature across all of the VFCS Servers in that itcan survive crashes of one or more individual VFCS Servers.

[0183] Station Control Unit and Data Repository

[0184]FIG. 20 is an illustration of the control unit and data of astation in the SCDN in accordance with an embodiment of the presentinvention. Station 1410 includes control unit 1550 and data repositories2000. Control Unit 1550 may be an embedded system that includes foursubsystems, in one embodiment of the invention. FIG. 20 identifies theControl Unit's subsystems and data repositories of a station. ControlUnit 1550 includes Resource Management Subsystem 2050, LearningSubsystem 2060, Storage Management Subsystem 2070, and ServiceManagement Subsystem 2080, collectively called control subsystems. DataRepository 2000 within the Station includes Network Resource Repository2010, History and Statistics Resource Repository 2030, Event ResourceRepository 2040, and Content Repository 1530.

[0185] The Control Unit's Service Management Subsystem 2080 manages thestation's DSs and VFCS Servers. The Resource Management Subsystem 2050supports SCDN network and service configurations and log and usage dataroll up activities. Learning Subsystem 2060 supportsauto-initialization, incremental content learning, and other adaptivemethods for management and control of the station. Storage ManagementSubsystem 2070 monitors cluster storage usage, supports content ratingand pruning, and notifies the CMS of the storage usage of each contentprovider. Service Management Subsystem 2080 monitors and controlsservices based on threshold settings, issues SNMP (Simple NetworkManagement Protocol) traps, export Enterprise MIB (managementinformation bases), and export history, statistics, and event data. Itwill be evident to those of ordinary skill in the art that the functionsdescribed herein are used for convenience and that other functions maybe added, subtracted, or substituted so long as they result in efficientand reliable control and management of the SCDN station.

[0186] Control Subsystems of the Station Control Unit

[0187] Resource Management Subsystem 2050 includes a ConfigurationServer, a Resource Manager, and a Content Usage Statistics Rollup Agent.The Configuration Server supports the configuration of the Station,i.e., the initialization and maintenance of the configuration data inthe Network Resource Repository.

[0188] The Configuration Server of the Central Station allows theconfiguration of an attribution table for the SCDN. This configurationdata is also maintained in Network Resource Repository 2010. Using FIG.25 as an illustration, when a new station (e.g., Station J) is createdand configured, the Resource Manager of Station J notifies the ResourceManager of its parent station (e.g., Station C) and the Resource Managerof the Central Station to update their topology maps and roll up theattributes of Station J. The Resource Manager of Station G updates itspartial topology, notifies its DSs of the new station, and sends itsneighbor station's (e.g., Stations C and I) Resource Managers the samedata. All Resource Managers within a two-hub, for example, vicinity ofStation J update their partial topology map and notify their DSs.

[0189] The Resource Manager of Station G then rolls up the attributes ofStation J to the Resource Manager of the parent of Station C. In thesuccessive roll-ups that follow, the attributes of Station J would reachall the way to the SCDN's root station.

[0190] When the Resource Manager of the Central Station receives a newstation notification, it adds the new station to its SCDN networktopology. The Central Station keeps a full copy of the SCDN networktopology. Only the Central Station owns the SCDN attribute table; thus,its Resource Manager responds to queries regarding entries in thistable.

[0191] When attributes of Station Hare changed, the attributes arerolled all the way up to SCDN's root station through the chain ofResource Managers. The Resource Manager of Station H also invokes itslocal Learning Agent to update the local content in accordance with itsnew attributes.

[0192] In the event of changes to the IP address of the Control Unit ofStation H, or the IP address of the primary DS of Station H, or the IPaddress of the DSs “Load Balancing Router of Station H, the ResourceManager of Station H would notify all neighboring stations” ResourceManagers to update their Network Resource Repository. These ResourceManagers would in turn notify their neighbors of the changes. Thepropagation of the changes may terminate after two-hubs.

[0193] A Resource Manager manages the local Network Resource Repositorydata, communicates with other Resource Managers to update the data, anddistributes the configuration data to the local services, such as theDSs and VFCS Servers. A Content Usage Statistics Rollup Agentperiodically rolls up Content Service and Content Usage to the relevantContent Management Server.

[0194] The Learning Subsystem 2060 provides adaptive methods of stationmanagement and control. Learning occurs when the attributes of a stationchanges, which includes the creation of a new station. Learning can alsobe used to recover content due to storage failure. Learning is performedby the Learning Agent in the Learning Subsystem and is invoked by theResource Manager. In one embodiment of the invention, there are twodifferent learning modes active and passive, content learning includestwo phases the discovery phase and the content modification phase.

[0195] In Active mode, during the discovery phase, a Learning Agentqueries all Content Management servers in the network for a list ofcontents to be downloaded or deleted as a result of the attributechanges. The Learning Agent locates the Content Management Servers fromthe Content Provider Data Table in the Content Repository. For a newstation, the Learning agent gets the Content Provider Data Table fromits SCDN parent node and saves the table into the Content Repository ofthe new station. During the content modification phase, which followsthe discovery phase, the Learning agent deletes unnecessary content byissuing remove requests to a local DS for the specific media files to beremoved. To add content, the Learning agent iterates through the contentlist it obtained during the discovery phase, and for every file in thelist, it issues an FDP “fetch” or similar request to the DSs in StationH. For each file, a DS in Station H issues a “fetch_info” or similarpacket to the DSs of the assigned station of the appropriate contentprovider's CMS. This is done to retrieve each file's metadata. A DS inStation H then issues an FDP search or similar request to each of itsneighboring DSs to locate the file. Whenever a DS in the network, forexample a DS in Station D, receives a search request for a file, the DSpasses the request to all its qualified neighbors (e.g., Station B). Ifthe requested file exists at Station D, the DS in Station D issues anFDP type “search_reply” to the DSs in Station H. A DS at Station H thenissues FDP “get” to download the content. A search request may yieldmultiple “search_reply” commands being sent to the learning station.Each “search_reply” includes the service and network load of thesearched Station D. The DSs at Station H download each file from theleast “busy” station(s). A file may be downloaded from multiplelocations in parallel. The FDP protocol includes a priority tag. TheLearning Agent may control its learning speed by adjusting the prioritytag in the prepare request. The Learning Agent may also control itsfetch request rate. One advantage of active learning is that the contentlearning table can be manually created to direct a Learning Agent todelete or download content. As the DSs download new files, the LearningAgent picks up the history log from the local DSs and determines whenlearning has been completed.

[0196] In the passive learning mode, during discovery phase, theLearning Agent issues a learn request to the DSs at every neighboringstations. The learn request includes the old and new attributes of thelearning station. Every station forwards the learn request to its ownneighbors, such that the learn request would propagate through theentire network. Upon receiving a learn request, a DS at a given Station(e.g., B) examines the old and new attributes of the learning Station(e.g., H), and obtains a list of necessary media files for Station Hfrom Station B's local storage. For each media file in the list, a DS atStation B issues an FDP “replicate” or similar request to the DSs atStation H. Station H collects the list of necessary content, figures outwhat it needs to delete and what it needs to download. During thecontent modification phase in the passive mode, based on the list ofcontent it obtained during the discovery phase, the DS cluster inStation H issues “remove” command to itself to remove unnecessarycontent, and “get” commands or similar request to the DSs in the Stationwhere the “replicate” request was issued (e.g., B) to download portionsof the file. A DS may yield the processing of learn requests to othermore important requests. The learn request may result in the issuance ofthe “replicate” notification for the same media file from one or morestations, by downloading a file from multiple locations, the DS ispreventing congestion of any particular node in the network.

[0197] The Storage Management Subsystem 2070 includes a StorageManagement Agent as its primary component. The Storage ManagementAgent 1) monitors the total local storage availability and the storageavailability of a content provider; 2) adjusts the “popularity” index ofa file; 3) determines a storage safety threshold for each contentprovider; 4) schedules content pruning; 5) computes pruning amount; 6)removes the least likely to be used blocks of a file; and 7) reportsstorage usage information and shortage warnings to Content Managementservers.

[0198] The content provider, through a Content Management application,sets the initial “popularity” index of a file. This initial value servesas a prediction of the likelihood of the file to be accessed in the nearfuture. The DSs rely on the “popularity” index, along with storageavailability, location of station, and network environment, to decide onwhat portions of a file, the initial block size, and the number ofblocks that is output to local storage by the blocking process 930 (FIG.9).

[0199] The Storage Management Agent uses the VFCS Server history logdata and data in the File Metadata Database to determine a reasonablestorage safety threshold, adjusts the “popularity” index of a file, andidentifies the least likely to be used blocks. A storage safetythreshold is the minimum amount of free storage each content providermust reserve at all times. Based on storage availability and the DSactivities, the Storage Management Agent determines the total amount ofdata to be pruned for each content provider and schedules the deletionof the least likely to be used blocks.

[0200] When content pruning rate for a content provider exceeds acertain limit, the Storage Management Agent issues an RPC call (RemoteProcedure Call) to notify the Content Management Application server towhich the content provider is assigned. The Content ManagementApplication prevents a content provider from uploading any new contentwhen the content provider's storage is low.

[0201] In one embodiment of the invention, the Service ManagementSubsystem 2080 includes the following components: History Log Handler,Statistics Handler, Event Handler, Threshold Monitor, Trap Agent, SNMP(Simple Network Management Protocol) stack, Presentation Agent, andService Agreement Policy Agents. A History Log Handler and a StatisticsHandler collect statistics and task/transaction logs from the localdevices and Servers, and save all log and statistic information into theHistory and Statistics Repository. While a station is learning, aHistory Log Handler forwards all the file download records to theLearning Agent to notify the agent of the download status. This handleralso forwards the inbound and outbound data transfer informationrecorded from local DSs to the Content Provider Storage Usage Table. TheContent Usage and Statistics Database is also updated by the StatisticHandler.

[0202] An Event Handler saves received events into the Event DataRepository 2040. The events stored may originate from any of the DSs,VFCS Servers, control units, or any other devices in the station.Depending on the event class and the severity of a problem, the EventHandler may report the event to the Trap Agent. The Threshold Monitorconstantly compares various threshold settings against current readingscollected by the Statistics Handler. If a threshold is reached, theThreshold Monitor forwards alarms to the Trap Agent. The Trap Agentreceives events and alarms from the Event Handler and Threshold Monitor.It logs the events and alarms and forwards them to the PresentationAgent and SNMP Trap Agent to notify operators. The Presentation Agentdistributes program objects (e.g., Java applets) to the ServiceManagement application and to the end-user's browser. The appletschannel threshold settings, performance data, network topology, usagelog, and events from data repositories to network operators.

[0203] Data from the History and Statistics Repository and EventRepository can be either pushed to, or pulled from, a PresentationAgent. Service Agreement Policy Agents retrieve data from History andStatistics Repository and feed the information to a Service AgreementPolicy Server, where business agreement and policy (such as guaranteedquality of service per customer) can be enforced.

[0204] Network Resource Repository of a Station

[0205] The Network Resource Repository 2010 contains network and stationconfiguration data. The network configuration data may include thetopology of partial or the entire network and a complete attributetable. This data is created and updated by Resource Management Subsystem2050.

[0206] The station configuration data includes the IP addresses of allthe devices, station attribute, rolled up attributes, load balancingconfigurations, database configuration, routing configuration, statisticdata collection interval, heartbeat interval, local storage volumes andtheir configuration, etc. The configuration data is created and updatedby Resource Management Subsystem 2050.

[0207] History and Statistics Repository of a Station

[0208] The History and Statistics Repository 2030 stores data gatheredby the Service Management Subsystem. This data repository includes 1)history logs of the devices, 2) server and network statistics, 3) thecontent provider usage table, and 4) the content usage and statistictable. The foregoing data collections contain information obtained frommany sources, including: the DSs, VFCS Servers, Application Servers,Learning Subsystem 2060, load balancers, and Storage Managementsubsystem 2070.

[0209] Learning Subsystem 2060 uses the history information to interpretthe state of learning.

[0210] Service Management Subsystem 2080 evaluates statisticsinformation and compares it to a user-defined resource-usage thresholdto decide whether to send a notification to an operator via themanagement console, or turn services on or off as configured by theoperators.

[0211] Storage Management Subsystem 2070 uses the history logs from DSsand VFCSs to determine when, what, and how much content to prune.

[0212] The content provider usage table is generated by StorageManagement Subsystem 2070 from data gathered by Service ManagementSubsystem 2080. The data roll up function provided by ResourceManagement Subsystem 2050 rolls up a copy of this same information tothe assigned Content Management Server of each content provider.

[0213] The content usage and statistics table data is gathered byApplication Server usage log parsers and forwarded to the Control Unit'sdatabase by Service Management Subsystem 2080. A copy of this sameinformation is rolled up to the assigned Content Management Server ofeach content provider by the roll up function provided by ResourceManagement Subsystem 2050.

[0214] Event Resource Repository of a Station

[0215] Event Resource Repository 2040 includes data sets that supportevents (e.g., notification, warning, and error message), job queue,server heartbeat, and server registry data. The server registry dataincludes the Server ID, service type, etc. The Service ManagementSubsystem gathers the notification, warning, and error messages from avariety of local sources, including the DSs, VFCS servers, the ResourceManagement Subsystem, the load balancers, the Learning Subsystem, andthe Storage Management Subsystem. Station “events” are organized intodifferent categories, and notifications are generated and forwarded tothe management console in accordance with station configuration data.Service Management subsystem 2080 relies on the heartbeat table todetermine if a server is functioning. The DSs use the server registry,heartbeat table, and job queue to load-balance their server cluster, andto monitor one another for fault-tolerance. Service Management Subsystem2080 uses the server registry and heartbeat table to monitor theservices in the station, it shutdown during power failure and restartservices upon server failure.

[0216] Content Repository of a Station

[0217] Content Repository 1530 includes Content Provider Information,File Distribution Criteria of the media files residing locally, FileMetadata, and the content blocks. The content provider informationincludes the content provider's account information, assigned ContentManagement Server, reserved storage, number of media files, etc. TheFile Metadata includes the media file's attributes, information on howthe media file is divided into block files, and the indexes in the localstorage volumes for its block files. The content repository 1530 mayspan multiple local storage volumes. For example, content blocks of amedia file are distributed across multiple storage volumes. The Contentrepository is also called the Shared Storage System.

[0218] There are multiple storage volumes in the shared Storage System1530 (FIG. 15). These volumes contain a number of important databasesillustrated in FIG. 20 such as: The Content Provider Data Table, FileDistribution Criteria Table, the File Metadata Database, and the contentblock files. These databases are stored independently and may be mappedarbitrarily anywhere within shared Storage System 1530. The ContentProvider Data Table and File Distribution Criteria Table also exist ineach Content Management Server system. The tables in the ContentManagement Server only include the data of the content providers thatare assigned to that CMS.

[0219] The Content Provider Data Table at each station includes theinformation of all the content providers of the SCDN, and the FileDistribution Criteria Table includes only the media files that arereplicated to the station.

[0220] Only the DSs, VFCS Servers, and the SMS 2070 can access theStorage System. The DSs can read and write to the shared Storage System;however, the VFCS Servers and the SMS 2070 can only access it in aread-only mode. The Learning Agent also writes to the Storage Systemwhen it creates the initial Content Provider Data Table during theLearning Agent's initialization phase.

[0221] The Content Provider Data Table includes information such ascontent provider account information, the content provider assignedContent Management Server address, reserved storage, content provider'spolicy server, etc.

[0222] File Distribution Criteria Database includes the distributioncriteria for each content file.

[0223] Block files contain the actual content for each content file. Ahashed key which is a combination of the content provider ID, media fileID, track ID, and block number is used to define the path name of theblock files for accelerated data access.

[0224] The File Metadata Database

[0225] The File Metadata Database holds file metadata related to theblock files which includes content provider ID, initial popularityindex, block size, actual usage rating, media size, attributes, minimumretained size, access time stamps, track file indices, block fileindices, storage volume indices, etc.

[0226] As indicated, the file metadata specifies the block size used forits associated file.

[0227] All blocks in the file are the same size, except for the lastblock, which will be smaller unless the file (if the file is a linearfile) or the last track (if the file is a non-linear file) happens to beof a size that is an exact multiple of the block size.

[0228] The file metadata also includes information to construct ablock's actual location.

[0229] Since blocks can be distributed across multiple storage deviceswithin the Storage System, there may be multiple block storage pathroots. Within each storage path root, a block's location and file nameare deterministic. A series of subdirectories is created to ensure thata limited number of files and subdirectories are contained within agiven directory.

[0230] Distribution servers communicate with one another and the ContentManagement application in order to transfer large payload files in theSCDN. The DSs modify entries in the File Metadata Database when they addor remove blocks in the shared Storage System. A sequence server, whichserves essentially as a lock manager, may be used to synchronize accessto the file metadata database by multiple DSs, VFCS servers, storagemanagers, etc., to prevent possible race (e.g., conflict) condition.VFCS servers use information in the File Metadata Database to assembleand multiplex appropriate blocks into files for the Application Servers.The Storage Management Subsystem watches the available shared storage,the content provider's reserved storage, and the usage logs. Itinitiates the removal of less popular content to make room for morepopular and new content when available storage is running low. It doesthis by instructing the DS to remove some of their associated blocksthat are least likely to be used. It accesses the File Metadata Databaseto determine how many and which blocks it will request to be deleted.

[0231] The particular implementation of the Content Repository dependson the host environment. For example, it could be a traditional RDBMS(relational database management system) or it could be a collection offlat files in directories. For performance and reliability reasons, oneembodiment of the invention uses flat files in directories to implementthe Content Repository. Tables are implemented as either a single filewith fixed-length records, or as separate files for each record. Using asingle file has performance advantages when reading a complete list ofrecords or when searching records when the record ID is not known. Usingseparate files has performance advantages when accessing a record via aknown record ID. The Content Provider Data Table, File DistributionCriteria Table, and File Metadata Database are stored in a directorywhose path is known to the interface that the DSs, VFCS Servers, and theSMS 2070 use to access the file metadata stored therein.

[0232] Station Operation and Data Flow

[0233] Examples of Station operation and data flow are given in thecontext of FIGS. 221A through 21G. In conjunction with these figures,several interactions between the Application Servers, VFCS Servers, andthe Distribution Servers will be identified below:

[0234]FIG. 21A illustrates the request of a large payload file, thepassing of the request to a selected VFCS server, a request to a DS toprepare the file, initial retrieval of the file from shared storage.Table 1 shows the station interactions: [t2] TABLE 1 StationInteractions in FIG. 21A Reference # Interaction Description 2101AIncoming request to Load Balancing and Routing Function 1820 and 1825from end-user 2101B Request delivered to selected AS within AS<1..M>1810 2101C Application Server request delivered to Load Balancing andRouting Function 1830 and 1835 2102 Load Balancing and Routing Function1830 and 1835 selects one of the VFCS Servers, e.g., VFCS 1840-1 (anarbitrary illustrative one of 1840-1 through 1840-L), and passes therequest to it. 2103 VFCS 1840-1 requests a DS, via Load Balancer 1720,to “prepare” the file 2104A VFCS 1840-1 begins retrieving data from theshared storage.

[0235]FIG. 21B illustrates initial return of file data, forwarding therequest to a selected DS, the issuance of a search request for missingportions, storage of network retrieved portions, and logging of usageinformation. Table 2 shows the station interactions: [t4] TABLE 2Station Interactions in FIG. 21B Reference # Interaction Description2104A VFCS 1840-1 assembles and multiplexes the blocks retrieved fromStorage System 1530 into a file in real time. (Whenever a block isrequired, i.e., either now or in the future, the VFCS signals the DS ofthis fact. VFCS 1840-1 then polls the File Metadata Database until thefact that the required block has been stored in the Storage System hasbeen indicated.) 2104B VFCS 1840-1 passes data for the ApplicationServer through Load Balancing and Routing Function 1830 and 1835. 2104CLoad Balancing and Routing Function 1830 and 1835 returns dataoriginating from VFCS 1840-1 to the Application Server. (The ApplicationServer continues to request data from VFCS 1840-1 until the entire filehas been returned or VFCS 1840-1 fails.) 2104D The Application Serverpasses data for the end-user through Load Balancing and Routing Function1820 and 1825. 2104E Load Balancing and Routing Function 1820 and 1825returns data originating from the Application Server to the end-user.2105 Load Balancer 1720 selects an available DS, e.g., DS 1710- 1 (anarbitrary illustrative one of 1710-1 through 1710-N), and forwards therequest from VFCS 1840-1 to DS 1710-1. 2106A DS 1710-1 issues a searchrequest for the missing portions and locates the most available DSs.2106B Multiple DSs in DS cluster 1710 download missing portions frommultiple remote DSs in parallel. 2107 DSs 1710 create or update relatedFile Metadata Database information as appropriate for the downloadedportions, and save the downloaded portions as blocks. The blocks arestored across multiple storage volumes. 2108A As VFCS 1840-1 returnsdata to the Application Server, VFCS 1840-1 logs the usage informationinto a Usage Log database in CU Local Storage 2005. 2108B VFCS 1840-1access to the CU Local Storage is via Switch 1515.

[0236]FIG. 21C illustrates retrieval of usage information, retrieval ofcontent provider storage reservation and storage availability data, andrelated storage management activities commanded by the control unit andcarried out by a selected DS. Table 3 shows the station interactions:[t14] TABLE 3 Station Interactions in FIG. 21C Reference # InteractionDescription 2109 The Storage Management Subsystem within the ControlUnit 1550 retrieves the file usage information. 2110A Via Switch 1515,the Storage Management Subsystem retrieves the Content Provider data,and reads the shared storage availability of the File Metadata Database.2110B The Storage Management Subsystem receives the data from the Switch1515 and uses the Content Provider data to identify the contentprovider's storage reservation. 2111 Based on the storage availability,content provider's storage reservation, media file usage information,and media file's storage occupancy, the Storage Management Subsysteminstructs DS, via Load Balancer 1720, to remove the least likely to beused blocks. The Storage Management Subsystem also updates the file'spopularity level. The Storage Management Subsystem has multiple pruningengines that it can apply based on the storage and network trafficsituation. 2112 The request from Storage Management Subsystem arrives atLoad Balancer 1720, which selects an available DS, e.g., DS 1710-2(another arbitrary illustrative one of 1710-1 through 1710-N). 2113 DS1710-2 removes blocks from the specified files and updates the FileMetadata Database appropriately

[0237]FIG. 21D illustrates the receipt and update of content providerinformation. Table 4 shows the station interactions: [t7] TABLE 4Station Interactions in FIG. 21D Reference # Interaction Description2114A When a new content provider is added to Content Managementapplication database, or when the content provider's informationchanges, the Content Management application sends an “content providerinfo” packet to all the stations in the SCDN. Load Balancer 1720receives this packet. 2114B The DS load balancer of each station selectsa DS and forwards the “info” packet to that particular DS. 2114C Theselected DS updates or adds the content provider information into theContent Provider Data Table. 2114D DS sends information packet to allits other neighbors

[0238]FIG. 21E illustrates the receipt and organization of contentportions in the primary station assigned to a CMS. Table 5 shows thestation interactions: [t8] TABLE 5 Station Interactions in FIG. 21EReference # Interaction Description 2115A When a new file is uploaded tothe SCDN, the Content Management application issues “put” request alongwith the file targeted to a DS of its assigned station. Load Balancer1720 receives this put request. 2115B The DSC's load balancer of theassigned station selects a DS and forwards the put request to thatparticular DS. 2115C The DS selected by the DSC's load balancer dividesthe received portions into blocks and saves the blocks into it sharedstorage and creates entries into the File Metadata Database. (TheContent Management application then issues a “distribution” request todistribute the file in accordance with the FDP protocol.)

[0239]FIG. 21F illustrates receipt of a distribution request and theissuance of a replicate request. Table 6 shows the station interactions:[t9] TABLE 6 Station Interactions in FIG. 21F Reference # InteractionDescription 2116A The Content Management Application connected to theassigned station associated with a CMS issues a “distribution” requestto distribute a file in accordance with the FDP protocol. The DSC's LoadBalancer 1720 of the assigned Station (i.e., FIG. 21F) receives thisdistribution request. 2116B The DSC's load balancer of the assignedstation selects a DS and forwards the distribution request to thatparticular DS. 2116C Upon receiving the distribution request, theStation's DS issues “replicate” request packets to its neighborstations, initiating delivery of content portions to the balance of theSCDN in accordance with the FDP protocol.

[0240]FIG. 21G is an illustration of receipt of a replicate request andthe issuance of a get request. Table 7 shows the station interactions:[t11] TABLE 7 Station Interactions in FIG. 21G Reference # InteractionDescription 1216D Load Balancer 1720 receives a replicate request 2116EThe DSC's load balancer of the station selects a DS and forwards thereplicate request to that particular DS. 2116F The DS issues a “get”request to retrieve the content from multiple stations in thedistribution path. 2116G Upon retrieval of the content, the DS createsrelevant entries in the Distribution Data database and the File MetadataDatabase.

[0241] VFCS File System Implementation and Initialization

[0242] Each VFCS Server maintains a private file system that implementsa distributed virtual file system. This distributed virtual file systemprovides the illusion to an Application Server (AS) that the VFCS Serverlocally holds as a contiguous atomic whole the content file that the ASdesires, when in fact the content is generally stored in blocks acrossmultiple volumes across a network of stations. Furthermore, portions ofthe content may be in transit from other nodes of the SCDN. Each VFCSServer file system implements only a skeletal tree structure andadditional file metadata components are added on an as-needed andjust-in-time basis. Important to the understanding of the presentsection, these additional components are only added at the particularVFCS Server where they are required. In the remaining discussion of thissection, matters are described from the perspective of each VFCS Server.Unless otherwise indicated, the behavior described is independent of theexistence of any other VFCS Servers.

[0243] The distributed VFCS File System may be implemented in a numberof ways. In one embodiment of the invention, it is represented by a UnixVNODE structure in which a node is either a directory or a file. EachVNODE has a unique identifier that represents either a content provideror a content vendor file in the SCDN. A specific content provider filecan only be retrieved using a file path that is encoded with its contentprovider's name.

[0244] The root directory of the VFCS server's private file systemcontains a list of the names of each content provider and a subdirectoryfor each content provider. Each content provider subdirectory contains alist of that provider's files. When its private file system isinitialized, the VFCS Server accesses the list of the content providernames in order to initialize the content provider directories. However,the content provider's content files are not initialized when the VFCSServer is initialized. Rather, they are populated upon an ApplicationServer request for the content files or notification from the DS orsequence server as popular new contents arrive. This process is referredto herein as “selective and dynamic initialization”. In accordance withthe invention, the particular elements selected for initialization andthe time at which they are initialized (at initialization time or at runtime) are selected based on system performance concerns.

[0245] The VFCS Server maintains several caches in its main-memory,typical examples include:

[0246] 1. a cache for content provider information.

[0247] 2. a cache for content provider file information.

[0248] 3. a cache containing portions of the framework of the VFCS FileSystem (i.e., the VFCS VNODE data, but generally not the entire VNODEtree).

[0249] 4. a cache for “pre-fetched” blocks that are used to increase theperformance of the assembly and multiplexing processes.

[0250] The VFCS Server periodically checks the Content Provider DataTable and the File Metadata Database to determine if entries in eitherhave changed and, if so, updates its caches appropriately. The periodiccheck could also be realized by a notification mechanism initiated by aDS or sequence server to notify all of the VFCS Servers when any entrieshave changed, such as when a new file is uploaded or when an old filehas been pruned (discarded) to save storage space. When an ApplicationServer attempts to access a file for which the file metadata informationis not in cache, the VFCS Server verifies that the file is notaccessible from the SCDN before returning an error indication, “file notfound”.

[0251] In one embodiment of the invention, the VFCS may maintain cachessuch as:

[0252] 1. Content Provider Name Cache: content provider name and ID.

[0253] 2. File Name Cache: file name, ID, number of tracks, number ofblocks per tracks, the origin location of the media file, number ofblocks currently residing in the shared Storage System.

[0254] 3. File System Cache: In an VFCS VNODE tree embodiment, each nodein the tree has a handle. The root forms the “first layer” of the treeand its handle is a constant. The “second layer” of the tree includesthe content provider nodes and the content provider ID is used as thehandle. The “third layer” of the tree includes the file nodes and thefile ID is used as the handle.

[0255] 4. Pre-Fetched Blocks Cache: blocks that have been pre-fetched tobe used in the assembly and multiplexing processes.

[0256] In an ideal environment where there is unlimited memory,performance could be maximized by pre-populating the VFCS server'sprivate file system with the information necessary to support an ASrequest to any file stored at the station. However, in the more generallimited memory scenario, “selective and dynamic initialization” and“selective and dynamic caching” are done as described previously toachieve the best possible performance. The VFCS Server reads the ContentProvider Data Table and the File Metadata Database from the sharedSystem Storage 1530 during its initialization process and cachesportions of this data in its main-memory. Upon servicing a request by anAS for a specific content provider file, the VFCS Server will augmentits private file system to include the particular file's attributes. TheVFCS Server obtains the additional file attribute information from thefile metadata that was cached during the VFCS server's initialization.The additional file-specific information is maintained in the VFCSserver's private file system until the server restarts or when memory islow and the file has not been accessed for a long period of time.

[0257] VFCS Initialization Procedure

[0258]FIG. 22 is a flow diagram of the operations of a VFCS Serverperformed during the VFCS initialization process in accordance with anembodiment of the present invention. In this illustration, networkattached storage (NAS) devices are used for the shared storage system.The Content Provider Data Table and the File Metadata Database aremounted in operation 2201 in order to provide access their data. Forpurposes of this illustration, assume these files are mounted on/mp/metadata. In order to access the entire set of blocks available inthe storage system, all of the content volumes are mounted in operation2202. For purposes of this explanation, the mount points are/mp/blockfiles, e.g., /mp/blockfiles/v1, /mp/blockfiles/v2, etc. TheVFCS Server initializes the content provider's name cache by loading theContent Provider Data Table into the cache (e.g., operation 2203). TheContent Provider Name Cache includes the content provider names and IDs.In operation 2204, the VFCS Server begins building the file systemCache. At this step, the structure of the file system to be exported maybe initialized. One embodiment of the invention may use a Unix VNODEtree to represent the In-Memory file system. Thus, the initializationincludes the creation of a root VFCS VNODE for the exported rootdirectory and the assignment of a constant handle to this directory. Forpurposes of this explanation, the exported directory is /export. TheVFCS then, as indicated in operation 2205, continues to build the filesystem Cache by creating the Content Provider Directories, i.e., thecontent provider VNODE data and structure are initialized. For example,the Content Provider Directories take the form /export/cp_name1,/export/cp_name2, etc. There is one VNODE for each directory and thehandle of each directory is the provider's ID. Suppose, for example,Studio X is a content provider and its provider ID is “123”. When anapplication accesses the Studio X directory using its name, a handle of123 is returned to the application. The application can also use “123”to access the Studio X directory, in which case, a numeric handle of 123is returned. In operation 2206, VFCS initializes the Content ProviderFile Name Cache. For example, the VFCS Server obtains a complete orpartial list, depending on memory availability, of file names and IDsfor each content provider from the File Metadata Database. VFCS does notcreate the VNODEs for these files until they are accessed. In operation2207, VFCS exports its file system. This is an example of “selective anddynamic caching”, i.e., the caches that are selected for populating andwhen they are populated (at initialization time or at run time) aredetermined for performance reasons.

[0259] VFCS continues to build the file system Cache during run timewhen files are accessed. When an Application Server accesses a specificfile, for example, /export /cp_namej/file_nameX, the VFCS Serverservicing the request looks up file_name in the content providerfile_name list, creates a VFCS_VNODE for the corresponding file in both/export/cp directory, and obtains the list of block files for the file.At the same time, the VFCS Server issues a “prepare” request packet to aDS via the DSC Load Balancer. After the DS downloads the requestedcontent portions, stores the portions as blocks, updates the FileMetadata Database to reflect this; and after the VFCS polls the FileMetadata Database and recognizes the blocks are present in the StorageSystem; the VFCS Server reads, assembles, and multiplexes them and sendsthe content to the requesting Application Server. Each VFCS Serverperforms read-ahead caching to improve performance.

[0260] VFCS File Access Procedure

[0261]FIG. 23 shows the VFCS Server operations performed during runtime. When an Application Server requests access to a file, the VFCSfirst checks to see if there is a node for the file in the VFCS FileSystem, in operation 2301, wherein the VFCS Server addresses thequestion, whether a VFCS node exist for the file? If it does, the VFCSserver proceeds to step 2305, otherwise, it proceeds to step 2302. Atstep 2302 the VFCS examines its File Name Cache to determine if an entryfor the file exists in the cache (i.e., does the Related File MetadataExist?). If no related file metadata exists, the VFCS Server proceeds tooperation 2303 and reads the File Metadata Database, caches the relatedfile metadata for the file in the File Name Cache and then proceeds tooperation 2304. However, if related file metadata already exists in theFile Name Cache, the VFCS Server proceeds immediately to operation 2304,where it creates the VFCS File System node for the file. After doingthis, the VFCS proceeds directly to operation 2305.

[0262] In operation 2305, the VFCS File Server checks to see if thereare any blocks for the requested file in the Pre-Fetch (transient) BlockCache. If there are no such blocks, the VFCS Server proceeds tooperation 2306 where it reads blocks associated with the requested filefrom the station's Storage System, sends a “prepare” request packet tothe station's DSC to repopulate the missing blocks, performs a readahead, and then proceeds to operation 2307. However, if there are one ormore blocks for the requested file in the Pre-Fetched Blocks Cache, theVFCS Server proceeds directly to operation 2307 from 2305.

[0263] In operation 2307, the VFCS Server assembles and multiplexes theblocks and forwards the data to the Application Server. VFCS may performread-ahead caching to improve performance. Furthermore, the VFCS Serverdoes packet spoofing to ship data directly from back-end storage tofront-end application without buffer copying.

[0264] When initialized, the VFCS File System contains a root node andthe Content Provider directories in the first two layers of the VFCSFile System tree. The third level of the VFCS File System tree containsthe content provider file directories and is populated dynamically. If acontent provider's file's metadata is not in cache when the file isrequested by an Application Server, the VFCS Server must read the file'smetadata from the File Metadata Database, cache this information, andthen create and attach a VNODE for the file in the VFCS File System'sVNODE tree. Once a file is attached to the VFCS File System, the VFCSServer sends a “prepare” request packet to a local DS, and performs“read ahead” operations until it reaches the end of the file.

[0265] The number of pre-fetched blocks a VFCS Server caches depends onthe local memory availability in the VFCS Server. The third layer of theVFCS File System may be pruned and the Pre-fetched Blocks Cache may beflushed when memory is running low. Depending on memory availability,the VFCS Server may cache a complete or partial set of thesedirectories. With limited memory, it caches the file metadata for onlythe most frequently accessed files and then updates the cache regularlybased on the recent usage information.

[0266] To support a specific number of content providers, say XCP, aspecific Y number of content provider files, say YF, and a number ofconcurrent users, say ZU, each with N number of pre-fetched blocks forbest possible performance, a VFCS Server is configured with a memorysize using the following formula:

[0267] Memory Size in Mbytes=(VFCS Server OS Memory Requirement)+(VFCSServer Runtime Memory Requirement)+XCP*(Memory Required for each ContentProvider Name Cache)+YF*(Memory Required for each File NameCache)+(1+XCP +YF)* (Size of VNODE tree)+ZU *N*(Block Size)

[0268] Content Publishing and Management and Other System-Related Tools

[0269] The Content Management Applications are suite of tools thatallow: (1) the owner of an SCDN (i.e., a service provider) to managecontent provider accounts and (2) the content providers to manage theirfiles in the SCDN. The tools access and update data distributedthroughout the SCDN. Content Management Applications cause data orrequest packets to be routed to the appropriate SCDN station(s).

[0270] Content Management Applications execute in a Client/Serverparadigm, i.e., a client running on a Content Provider Client System isused to invoke a Content Management Application that executes either on:(1) a Content Management Server (CMS); (2) a combination of the CMS andthe Content Provider Client System using program objects such as appletsand servlets; or any combination thereof.

[0271] There may be one or more CMSs in an SCDN. In addition to typicalresources such as processor and memory, each CMS has its own localstorage devices on which various content management related databasesare stored.

[0272] Each Content Provider uses a specific CMS. The service providerassigns the CMS used by a Content Provider to a specific Station. Whatthis means is that the assigned Station processes the CMS requests thatresult from the execution of the Content Management Applications by thatContent Provider. In one embodiment, one of the DSs in the assignedstation's DSC is selected by its load balancer to process the CMS'srequest. In addition to data related to Content Management Applicationsbeing stored on the CMS's local storage devices, other such data isselectively stored in either the station's Storage System or thestation's Control Unit's local storage devices.

[0273] Each Content Provider may be assigned to only one CMS; however,more than one Content Provider may be assigned to the same CMS.Furthermore, a CMS may only be assigned to a Station where the ContentProvider can upload files into the SCDN. When a Content Provider isassigned to a CMS, the CMS propagates the Content Provider informationand the IP address of the CMS to the entire SCDN via its assigned DSusing an FDP “info” packet, for example. A Content Usage StatisticsRollup Client (a component of the associated station's ResourceManagement Subsystem) connects to the CMS to roll up storage and contentusage information for each content provider.

[0274] The Content Management Server also uses the FDP “info” packet topropagate changes in the Content Provider Data Table.

[0275] Various Content Management Applications are used for entering andmanaging content provider information, the content's meta information,and the actual content. Applications are also used to retrieve usageinformation and performance statistics of the storage system andcontent.

[0276] Content Management Application Tools

[0277] The Content Management Applications include tools that may belocated on the CPC, the CMS, and the SCDN stations. These tools may bein the form of program objects, e.g., Java applets. Some typical toolsare presented below with reference to FIG. 20.

[0278] The Content Provider Management Client is a tool that providesUser Interface for content providers and operators to update contentprovider information that is stored in the Content Provider Table in theCMS system.

[0279] Content Provider Management Server is a tool that manages theContent Provider Data Table and sends information packets to the SCDNvia a DS in its assigned station. The DS creates its own ContentProvider Data Table in the station's Storage System.

[0280] The Content Management Client is a tool that provides a UserInterface for content providers to upload and delete their content,check storage usage, reserve storage, check content usage, etc.

[0281] The Content Management Server is a tool that acts as a bridgebetween the Content Management Client tool and the distribution server.It communicates with a DS in its assigned station using the FDP protocol(e.g., using the “put”, “distribute”, and “clean” commands). When theContent Management Client tool uploads a new file, the ContentManagement Server tool distributes (i.e., injects) the file into theSCDN via its assigned DS using FDP “put” and “distribute” packets.Content Management Server saves content provider information, andcontent distribution criteria in its database. While content isdistributed to the SCDN, the DSs involved in processing the distributionrequest store information related to the files and their constituentportions in the File Distribution Criteria Database and the FileMetadata Database. The files and their constituent blocks are stored inthe content repository distributed in the SCDN, also by DS involved inprocessing the request. The Content Management Server uses the FDP“clean” packet to remove a file from an SCDN. When a DS in the SCDNreceives a “clean” packet, it removes the relevant information from FileDistribution Criteria Database, File Metadata Database, and the actualcontent blocks from the content repository.

[0282] The Content Usage Statistic Rollup Client is a tool that isimplemented in the Control Unit of every Station. It forwards thecontent usage information from the History and Statistics Repository tothe Content Usage Statistic Rollup Server tool at the CMS system, wherethe content provider is assigned. The Content Usage Statistic RollupServer tool receives usage and statistic data and saves the data intoUsage and Statistic Database.

[0283] The assigned station's Control Unit's Storage ManagementSubsystem periodically forwards the content provider storage usage fromthe content data repository to the Content Provider Storage tool agents.A Content Provider Storage tool agent only receives storage usage of thecontent providers assigned to its Content Management Server, it storesthe storage usage data into the Content Provider Storage Usage Table.

[0284] A Billing tool and a Statistics tool are provided to exportinformation from the Usage and Statistics Database and the Usage andStatistics Database so both service and content providers can customizeinvoice statements and other communications with their customers.

[0285] Illustration of the Database Contents

[0286]FIG. 24 is an illustration of the contents of the contentmanagement and usage database of FIG. 20. Two CMSs are used in thisillustration, CMS 2410 and CMS 2411, three stations, Station 2401,Station 2402, and Station 2403, and two content providers, CPC-1, andCPC-2. In this example, the following will be assumed: [t10] 1 CMS 2410is assigned to Station 2401 2 CMS 2411 is assigned to Station 2403. 3CPC-1 is assigned to CMS 2410 4 CPC-2 is assigned to CMS 2411 5 CPC-1owns Content C1 (hereinafter simply referred to as C1) 6 CPC-2 ownsContent C2 (hereinafter simply referred to as C2) 7 C1 has beendistributed to Station 2401 and Station 2402 8 C2 has been distributedto Station 2403 and Station 2402.

[0287] Given these assumptions, in this example, for CMS 2410, we have:[t3] 1 Content Provider Database includes CPC-1 2 Content Provider UsageDatabase includes storage usage of CPC- 1 at Station 2401, Station 2402,and Station 2403 3 File Distribution Criteria Database includesDistribution Criteria of C1 4 Content Usage and Statistics Databaseincludes C1's usage information from Station 2401, Station 2402, andStation 2403 5 Since C1 is not distributed to Station 2403, there willbe no record from Station 2403

[0288] For CMS 2411, we have: [t5] 1 Content Provider Database includesCPC-2 2 Content Provider Usage Database includes storage usage of CPC- 2at Station 2401, Station 2402, and Station 2403 3 File DistributionCriteria Database includes Distribution Criteria of C2 4 Content Usageand Statistics Database includes C2's usage information from Station2401, Station 2402, and Station 2403 5 Since C2 is not distributed toStation 2401, there will be no record from Station 2401

[0289] For Station 2401, we have: [t12] 1 Content Provider Databaseincludes CPC-1 and CPC-2 because content provider data is replicated tothe entire SCDN 2 Content Provider Usage Database includes storage usageof CPC- 1 and CPC-2 at Station 2401 3 File Distribution CriteriaDatabase includes Distribution Criteria of C1 4 File Metadata Databaseincludes C1's file metadata 5 Data Blocks includes C1's content 6Content Usage and Statistics Database includes C1's usage information atStation 2401

[0290] For Station 2402, we have: [t13] 1 Content Provider Databaseincludes CPC-1 and CPC-2 2 Content Provider Usage Database includesstorage usage of CPC- 1 and CPC-2 at Station 2402 3 File DistributionCriteria Database includes Distribution Criteria of C1 and C2 4 FileMetadata Database includes C1 and C2's file metadata 5 Data Blocksincludes C1 and C2's content 6 Content Usage and Statistics Databaseincludes C1 and C2's usage information at Station 2402

[0291] For Station 2403, we have: [t6] 1 Content Provider Databaseincludes CPC-1 and CPC-2 2 Content Provider Usage Database includesstorage usage of CPC- 1 and CPC-2 at Station 2403 3 File DistributionCriteria Database includes Distribution Criteria of C2 4 File MetadataDatabase includes C2's file metadata 5 Data Blocks includes C2's content6 Content Usage and Statistics Database includes C2's usage informationat Station 2403

[0292] Out of Band Signaling and Control

[0293] In one embodiment of the invention, plug-in modules are providedat each Distribution Node for the Application Servers to use and locatethe “Out-of-Band” signals. The plug-in modules can invoke remote controlmodules for access control and value-added services. By providing suchan infrastructure, the distribution network allows content providers tocontrol their content at the edge of the network, and provide dynamicvalue added services.

[0294] Access control includes authentication and licensing by region,number of concurrent access, by user, etc. Value added services includedynamic localized and targeted advertisement insertion, dynamic previewand trailer insertions, and more. The “Out-Of-Band” signal also servesas a notification to content providers.

1. A method for distributing content of large payload file to aplurality of storage devices in a network node comprising: obtaining aplurality of block files representing content of a large payload filefor storage in a plurality of storage devices in a network node;associating said plurality of block files with said plurality of storagedevices; storing said plurality of block files in said plurality ofstorage devices based on said associations; creating a virtual file,using said associations, for presentation to a client requesting saidfile content, said virtual file providing an illusion to said clientthat said file content is contiguous in said network node.
 2. The methodof claim 1, wherein said network comprises a packet-communicationnetwork.
 3. The method of claim 1, wherein said obtaining a plurality ofblock files comprises: obtaining said large payload file from a user;evaluating said large payload file to locate a portion havingsubstantive content; determining if said content from said large payloadfile comprises linear characteristics by determining if said substantivecontent is located at a starting end of said large payload file;generating a track file if said content comprises said linearcharacteristics; generating a plurality of track files if said contentdoes not comprise said linear characteristics; determining at least onedesired block size; if said content comprises linear characteristics,dividing said track file to generate a plurality of block files, whereineach of said block files correspond in size to said at least one desiredblock size; if said content does not comprise linear characteristics,dividing each of said plurality of track files to generate a pluralityof block files, wherein each of said block files correspond in size tosaid at least one desired block size.
 4. The method of claim 3, whereinsaid desired block size is determined by selecting a block size tomaximize space usage within said network's maximum transmission unit. 5.The method of claim 3, wherein said network has a plurality ofdistribution nodes and said desired block size is determined byselecting a block size to minimize congestion at said distribution nodesof said network.
 6. The method of claim 3, wherein said desired blocksize is determined by selecting a block size to minimize fragmentationof said plurality of storage devices.
 7. The method of claim 3, whereinsaid at least one block size comprises a fixed value.
 8. The method ofclaim 1, wherein said associating said plurality of block filescomprises distributing said plurality of block files amongst saidplurality of storage devices such that said plurality of storage devicesare load balanced during input/output operations.
 9. The method of claim1, further comprising storing said associations in a file metadata insaid plurality of storage devices, said associations comprisinginformation for rebuilding said large payload file from said blockfiles.
 10. The method of claim 1, wherein said network comprises aplurality of nodes and said plurality of block files is obtained fromother nodes of said network.
 11. The method of claim 9, wherein saidcreating a virtual file comprises: obtaining information about saidlarge payload file from said file metadata; using said information toconstruct a virtual representation of said large payload file.
 12. Amethod for distributing content of a large payload file to a pluralityof storage devices in a network node comprising: obtaining a pluralityof block files representing content of a large payload file for storagein a plurality of storage devices in a network node; associating saidplurality of block files with said plurality of storage devices, whereinsaid associating comprises creating associations distributing saidplurality of block files amongst said plurality of storage devices suchthat said plurality of storage devices are load balanced duringinput/output operations; storing said associations in a file metadata insaid plurality of storage devices, said associations comprisinginformation for rebuilding said large payload file from said blockfiles; storing said plurality of block files in said plurality ofstorage devices based on said associations; creating a virtual file,using said associations, for presentation to a client requesting saidfile content, said virtual file providing an illusion to said clientthat said file content is contiguous in said network node.
 13. Acomputer program product comprising: a computer usable medium comprisingcomputer readable code for distributing content of large payload file toa plurality of storage devices in a network node, said computer readableprogram code configured to: obtain a plurality of block filesrepresenting content of a large payload file for storage in a pluralityof storage devices in a network node; associate said plurality of blockfiles with said plurality of storage devices; store said plurality ofblock files in said plurality of storage devices based on saidassociations; create a virtual file, using said associations, forpresentation to a client requesting said file content, said virtual fileproviding an illusion to said client that said file content iscontiguous in said network node.
 14. The computer program product ofclaim 13, wherein said network comprises a packet-communication network.15. The computer program product of claim 13, wherein said obtain aplurality of block files comprises: obtain said large payload file froma user; evaluate said large payload file to locate a portion havingsubstantive content; determine if said content from said large payloadfile comprises linear characteristics by determining if said substantivecontent is located at a starting end of said large payload file;generate a track file if said content comprises said linearcharacteristics; generate a plurality of track files if said contentdoes not comprise said linear characteristics; determine at least onedesired block size; if said content comprises linear characteristics,divide said track file to generate a plurality of block files, whereineach of said block files correspond in size to said at least one desiredblock size; if said content does not comprise linear characteristics,divide each of said plurality of track files to generate a plurality ofblock files, wherein each of said block files correspond in size to saidat least one desired block size.
 16. The computer program product ofclaim 15, wherein said desired block size is determined by selecting ablock size to maximize space usage within said network's maximumtransmission unit.
 17. The computer program product of claim 15, whereinsaid network has a plurality of distribution nodes and said desiredblock size is determined by selecting a block size to minimizecongestion at said distribution nodes of said network.
 18. The computerprogram product of claim 15, wherein said desired block size isdetermined by selecting a block size to minimize fragmentation of saidplurality of storage devices.
 19. The computer program product of claim15, wherein said at least one block size comprises a fixed value. 20.The computer program product of claim 13, wherein said associate saidplurality of block files comprises distributing said plurality of blockfiles amongst said plurality of storage devices such that said pluralityof storage devices are load balanced during input/output operations. 21.The computer program product of claim 13, further comprising computerreadable program code configured to store said associations in a filemetadata in said plurality of storage devices, said associationscomprising information for rebuilding said large payload file from saidblock files.
 22. The computer program product of claim 13, wherein saidnetwork comprises a plurality of nodes and said plurality of block filesis obtained from other nodes of said network.
 23. The computer programproduct of claim 21, wherein said create a virtual file comprises:obtain information about said large payload file from said filemetadata; use said information to construct a virtual representation ofsaid large payload file.
 24. An apparatus for distributing content oflarge payload file to a plurality of storage devices in a network nodecomprising: one or more first servers in a first server cluster of anetwork node obtaining a plurality of block files representing contentof a large payload file for storage in a plurality of storage devices insaid network node, said one or more first servers associating saidplurality of block files with said plurality of storage devices andstoring said plurality of block files in said plurality of storagedevices based on said associations; one or more second servers in asecond server cluster of said network node creating a virtual file,using said associations, for presentation to a client requesting saidfile content, said virtual file providing an illusion to said clientthat said file content is contiguous in said network node.
 25. Theapparatus of claim 24, wherein said network comprises apacket-communication network.
 26. The apparatus of claim 24, whereinsaid obtaining a plurality of block files comprises: a third serverobtaining said large payload file from a user, said third serverevaluating said large payload file to locate a portion havingsubstantive content and determining if said content from said largepayload file comprises linear characteristics by determining if saidsubstantive content is located at a starting end of said large payloadfile, said third server generating a track file if said contentcomprises said linear characteristics and transmitting said track fileto said one or more first servers, and said third server generating aplurality of track files if said content does not comprise said linearcharacteristics and transmitting said plurality of track files to saidone or more first servers; said one or more first servers receiving saidlarge payload file in the form of one or more track files, said one ormore first servers determining at least one desired block size fordividing said one or more track files into a plurality of block files,wherein each of said block files correspond in size to said at least onedesired block size.
 27. The apparatus of claim 26, wherein said desiredblock size is determined by selecting a block size to maximize spaceusage within said network's maximum transmission unit.
 28. The apparatusof claim 26, wherein said network has a plurality of distribution nodesand said desired block size is determined by selecting a block size tominimize congestion at said distribution nodes of said network.
 29. Theapparatus of claim 26, wherein said desired block size is determined byselecting a block size to minimize fragmentation of said plurality ofstorage devices.
 30. The apparatus of claim 26, wherein said at leastone block size comprises a fixed value.
 31. The apparatus of claim 24,wherein said associating said plurality of block files comprisesdistributing said plurality of block files amongst said plurality ofstorage devices such that said plurality of storage devices are loadbalanced during input/output operations.
 32. The apparatus of claim 24,further comprising said one or more first servers storing saidassociations in a file metadata in said plurality of storage devices,said associations comprising information for rebuilding said largepayload file from said block files.
 33. The apparatus of claim 24,wherein said network comprises a plurality of nodes and said pluralityof block files is obtained from other nodes of said network.
 34. Theapparatus of claim 32, wherein said creating a virtual file comprises:obtaining information about said large payload file from said filemetadata; using said information to construct a virtual representationof said large payload file.